Relevant bibliographies by topics / SALBP

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'SALBP'

Author: Grafiati
Published: 4 June 2021
Last updated: 6 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'SALBP.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "SALBP"

1

Dou, Jianping, Jun Li, and Xia Zhao. "A novel discrete particle swarm algorithm for assembly line balancing problems." Assembly Automation 37, no. 4 (September 4, 2017): 452–63. http://dx.doi.org/10.1108/aa-08-2016-104.

Full text
Abstract:
Purpose The purpose of this paper is to develop a feasible sequence-oriented new discrete particle swarm optimization (NDPSO) algorithm with novel particles’ updating mechanism for solving simple assembly line balancing problems (SALBPs). Design/methodology/approach In the NDPSO, a task-oriented representation is adopted to solve type I and type II SALBPs, and a particle directly represents a feasible task sequence (FTS) as a permutation. Then, the particle (permutation) is updated as a whole using the geometric crossover based on the edit distance with swaps for two permutations. Furthermore, the fragment mutation with adaptive mutation probability is incorporated into the NDPSO to improve exploration ability. Findings Case study illustrates the effectiveness of the NDPSO. Comparative results between the NDPSO and existing real-encoded PSO (CPSO) and direct discrete PSO (DDPSO) against benchmark instances of type I SALBP and type II SALBP show promising higher performance of the proposed NDPSO. Originality/value A novel particles’ updating mechanism for FTS-encoded particle is proposed to solve the SALBPs. The comparative results indicate that updating of FTS as a whole seems superior to existing updating of FTS by fragment with respect to exploration ability for solving SALBPs. The novel particles’ updating mechanism is also applicable to generalized assembly line balancing problems.
APA, Harvard, Vancouver, ISO, and other styles
2

Fathi, Masood, Dalila Benedita Machado Martins Fontes, Matias Urenda Moris, and Morteza Ghobakhloo. "Assembly line balancing problem." Journal of Modelling in Management 13, no. 2 (May 14, 2018): 455–74. http://dx.doi.org/10.1108/jm2-03-2017-0027.

Full text
Abstract:
Purpose The purpose of this study is to first investigate the efficiency of the most commonly used performance measures for minimizing the number of workstations (NWs) in approaches addressing simple assembly line balancing problem (SALBP) for both straight and U-shaped line, and second to provide a comparative evaluation of 20 constructive heuristics to find solutions to the SALBP-1. Design/methodology/approach A total of 200 problems are solved by 20 different constructive heuristics for both straight and U-shaped assembly line. Moreover, several comparisons have been made to evaluate the performance of constructive heuristics. Findings Minimizing the smoothness index is not necessarily equivalent to minimizing the NWs; therefore, it should not be used as the fitness function in approaches addressing the SALBP-1. Line efficiency and the idle time are indeed reliable performance measures for minimizing the NWs. The most promising heuristics for straight and U-shaped line configurations for SALBP-1 are also ranked and introduced. Practical implications Results are expected to help scholars and industrial practitioners to better design effective solution methods for having the most balanced assembly line. This study will further help with choosing the most proper heuristic with regard to the problem specifications and line configuration. Originality/value There is limited research assessing the efficiency of the common objectives for SALBP-1. This study is among the first to prove that minimizing the workload smoothness is not equivalent to minimizing the NWs in SALBP-1 studies. This work is also one of the first attempts for evaluating the constructive heuristics for both straight and U-shaped line configurations.
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Han-ye. "An immune genetic algorithm for simple assembly line balancing problem of type 1." Assembly Automation 39, no. 1 (February 4, 2019): 113–23. http://dx.doi.org/10.1108/aa-08-2017-101.

Full text
Abstract:
Purpose The purpose of this study is to develop an immune genetic algorithm (IGA) to solve the simple assembly line balancing problem of type 1 (SALBP-1). The objective is to minimize the number of workstations and workstation load for a given cycle time of the assembly line. Design/methodology/approach This paper develops a new solution method for SALBP-1, and a user-defined function named ψ(·) is proposed to convert all the individuals to satisfy the precedence relationships during the operation of IGA. Findings Computational experiments suggest that the proposed method is efficient. Originality/value An IGA is proposed to solve the SALBP-1 for the first time.
APA, Harvard, Vancouver, ISO, and other styles
4

Zhang, Haijun, Qiong Yan, Yuanpeng Liu, and Zhiqiang Jiang. "An integer-coded differential evolution algorithm for simple assembly line balancing problem of type 2." Assembly Automation 36, no. 3 (August 1, 2016): 246–61. http://dx.doi.org/10.1108/aa-11-2015-089.

Full text
Abstract:
Purpose This paper aims to develop a new differential evolution algorithm (DEA) for solving the simple assembly line balancing problem of type 2 (SALBP-2). Design/methodology/approach Novel approaches of mutation operator and crossover operator are presented. A self-adaptive double mutation scheme is implemented and an elitist strategy is used in the selection operator. Findings Test and comparison results show that the proposed IDEA obtains better results for SALBP-2. Originality/value The presented DEA is called the integer-coded differential evolution algorithm (IDEA), which can directly deal with integer variables of SALBP-2 on a discrete space without any posterior conversion. The proposed IDEA will be an alternative in evolutionary algorithms, especially for various integer/discrete-valued optimization problems.
APA, Harvard, Vancouver, ISO, and other styles
5

Arık, Oğuzhan Ahmet, Erkan Köse, and Jeffrey Forrest. "Simple assembly line balancing problem of Type 1 with grey demand and grey task durations." Grey Systems: Theory and Application 9, no. 4 (October 14, 2019): 401–14. http://dx.doi.org/10.1108/gs-05-2019-0011.

Full text
Abstract:
Purpose The purpose of this paper is to present a mixed integer programming model for simple assembly line balancing problems (SALBP) with Type 1 when the annual demand and task durations are uncertain and encoded with grey numbers. Design/methodology/approach Grey theory and grey numbers are used for illustrating the uncertainty of parameters in an SALBP, where the objective is to minimize the total number of workstations. The paper proposes a 0-1 mathematical model for SALBP of Type 1 with grey demand and grey task durations. Findings The uncertainty of the demand and task durations are encoded with grey numbers and a well-known 0-1 mathematical model for SALBP of Type 1 is modified to find the minimum number of workstations in order to meet both the lower and upper bounds of the uncertain demand. The results obtained from the proposed mathematical model show a task-workstation assignment that does not distribute precedence relations among tasks and workstations and the sum of task durations in each single workstation is less than or equal to the grey cycle time. Originality/value The grey theory and grey numbers have not been previously used to identify uncertainties in assembly line balancing problems. Therefore, this study provides an important contribution to the literature.
APA, Harvard, Vancouver, ISO, and other styles
6

Zacharia, Paraskevi T., Sotirios A. Tsirkas, Georgios Kabouridis, Andreas Ch Yiannopoulos, and Georgios I. Giannopoulos. "Genetic-Based Optimization of the Manufacturing Process of a Robotic Arm under Fuzziness." Mathematical Problems in Engineering 2018 (December 24, 2018): 1–12. http://dx.doi.org/10.1155/2018/9168014.

Full text
Abstract:
Fuzziness is a key concern in modern industry and, thus, its implementation in manufacturing process modeling is of high practical importance for a wide industrial audience. The scientific contribution of the present attempt lies on the fact that the assembly line balancing problem of type 2 (SALBP-2) is approached for a real manufacturing process by introducing fuzzy processing times. The main scope of this work is the solution of the SALBP-2, which is an NP-hard problem, for a real manufacturing process considering fuzziness in the processing times. Since the data obtained from realistic situations are imprecise and uncertain, the consideration of fuzziness for the solution of SALBP-2 is of great interest. Thus, real data values for the processing times are gathered and estimated with uncertainty. Then, fuzzy processing times are used for finding the optimum cycle time. The optimization tool for the solution of the fuzzy SALBP-2 is a Genetic Algorithm (GA). The validity of the proposed approach is tested on the construction process of a metallic robotic arm. The experimental results demonstrate the effectiveness and efficiency of the proposed GA in determining the optimum sequence of the tasks assigned to workstations which provides the optimum fuzzy cycle time.
APA, Harvard, Vancouver, ISO, and other styles
7

Jirasirilerd, Ganokgarn, Rapeepan Pitakaso, Kanchana Sethanan, Sasitorn Kaewman, Worapot Sirirak, and Monika Kosacka-Olejnik. "Simple Assembly Line Balancing Problem Type 2 By Variable Neighborhood Strategy Adaptive Search: A Case Study Garment Industry." Journal of Open Innovation: Technology, Market, and Complexity 6, no. 1 (March 18, 2020): 21. http://dx.doi.org/10.3390/joitmc6010021.

Full text
Abstract:
This article aims to minimize cycle time for a simple assembly line balancing problem type 2 by presenting a variable neighborhood strategy adaptive search method (VaNSAS) in a case study of the garment industry considering the number and types of machines used in each workstation in a simple assembly line balancing problem type 2 (SALBP-2M). The variable neighborhood strategy adaptive search method (VaNSAS) is a new method that includes five main steps, which are (1) generate a set of tracks, (2) make all tracks operate in a specified black box, (3)operate the black box, (4) update the track, and (5) repeat the second to fourth steps until the termination condition is met. The proposed methods have been tested with two groups of test instances, which are datasets of (1) SALBP-2 and (2) SALBP-2M. The computational results show that the proposed methods outperform the best existing solution found by the LINGO modeling program. Therefore, the VaNSAS method provides a better solution and features a much lower computational time.
APA, Harvard, Vancouver, ISO, and other styles
8

Huo, Jiage, Zhengxu Wang, Felix T. S. Chan, Carman K. M. Lee, and Jan Ola Strandhagen. "Assembly Line Balancing Based on Beam Ant Colony Optimisation." Mathematical Problems in Engineering 2018 (October 3, 2018): 1–17. http://dx.doi.org/10.1155/2018/2481435.

Full text
Abstract:
We use a hybrid approach which executes ant colony algorithm in combination with beam search (ACO-BS) to solve the Simple Assembly Line Balancing Problem (SALBP). The objective is to minimise the number of workstations for a given fixed cycle time, in order to improve the solution quality and speed up the searching process. The results of 269 benchmark instances show that 95.54% of the problems can reach their optimal solutions within 360 CPU time seconds. In addition, we choose order strength and time variability as indicators to measure the complexity of the SALBP instances and then generate 27 instances with a total of 400 tasks (the problem size being much larger than that of the largest benchmark instance) randomly, with the order strength at 0.2, 0.6 and 0.9 three levels and the time variability at 5-15, 65-75, and 135-145 levels. However, the processing times are generated following a unimodal or a bimodal distribution. The comparison results with solutions obtained by priority rule show that ACO-BS makes significant improvements on the quality of the best solutions.
APA, Harvard, Vancouver, ISO, and other styles
9

Grangeon, Nathalie, and Sylvie Norre. "Extending metaheuristics based on bin packing for SALBP to PALBP." European J. of Industrial Engineering 6, no. 6 (2012): 713. http://dx.doi.org/10.1504/ejie.2012.051073.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pastor, Rafael, Alberto García‐Villoria, and Albert Corominas. "Comparing ways of breaking symmetries in mathematical models for SALBP‐1." Assembly Automation 31, no. 4 (September 27, 2011): 385–87. http://dx.doi.org/10.1108/01445151111172970.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "SALBP"

1

Martucci, Enzo. "Algoritmo di Simulated Annealing applicato per il bilanciamento di una linea di assemblaggio." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017.

Find full text
Abstract:
L'assemblaggio rappresenta una delle attività centrali all'interno di una realtà industriale, in quanto da esso dipende la qualità del prodotto finito con il quale l'azienda si presenta sul mercato. Sulla base di ciò risulta fondamentale la gestione delle linee di assemblaggio da parte del management, il quale deve porre la sua attenzione sui costi e contemporaneamente sulla qualità del prodotto offerto. Chiaramente, assume una certa rilevanza il problema del bilanciamento di una linea di assemblaggio. In particolare, sulla base di un'accurata classificazione, questo studio fa riferimento ad una linea di assemblaggio di tipo serial, paced con task-time deterministico e multi-obiettivo. Inoltre, considerando il tempo ciclo un dato di input, il parametro che varia, da cui dipendono le diverse funzioni obiettivo da migliorare, è il numero di stazioni; questo tipo di problema, secondo la letteratura, è noto con il termine di SALBP_1 (Simple Assembly Line Balancing Problem). Il bilanciamento è considerato un problema di tipo NP-hard per cui risulta molto difficile trova una possibile soluzione con un approccio generico. A tal proposito, è introdotto l'algoritmo del Simulated Annealing, un approccio di tipo meta-euristico con il quale è possibile ottenere una possibile soluzione vicina all'ottimo. Con esso sarà infatti possibile gestire situazioni con una grande mole di dati ed insieme agli algoritmi genetici (con il quale sarà fatto un confronto) risulta essere una delle metodologie più utilizzate per approcciarsi con un caso quanto più vicino alla realtà. Il codice dell'algoritmo sarà implementato secondo il linguaggio di programmazione Visual Basic for Application (VBA) accessibile da Microsoft Excel. I risultati ottenuti nei vari casi analizzati risultano essere piuttosto soddisfacenti anche in termini di tempo computazionale. Infine, confrontano i risultati ottenuti con i due approcci, possiamo ritenere il Simulated Annealing una metodologia valida ed accurata.
APA, Harvard, Vancouver, ISO, and other styles
2

Rose, Christian. "Stabilitätsbeurteilung von O/W-Cremes auf Basis der Wasserhaltigen Hydrophilen Salbe DAB 1996." [S.l.] : [s.n.], 1999. http://deposit.ddb.de/cgi-bin/dokserv?idn=957820631.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pascual, Torner Maria. "Spatio-temporal processes explaining salp aggregations in the Catalan Sea, Northwestern Mediterranean." Doctoral thesis, Universitat Politècnica de Catalunya, 2016. http://hdl.handle.net/10803/400565.

Full text
Abstract:
Salps are marine pelagic tunicates that have evolved opportunistic skills to bloom under favorable conditions and persist during adverse periods. They experience population outbursts (blooms) which, combined with their efficient feeding mechanism, produce several ecological and societal consequences. Although salp blooms are common in the Catalan Sea during spring and autumn, their causes and effects on the ecosystem have never been studied in this area before. The general aim of the present thesis is to understand the spatial and temporal processes leading to salp blooms and estimate their trophic impact in the Catalan Sea, northwestern Mediterranean Sea. For this purpose, mechanistic (matrix models) and statistical models (GAMs) combined with in situ observations allowed us to propose the simplest mechanisms to account for bloom development. In contrast to previous hypotheses, we found that changes in female reproduction drive the population to latency under unfavorable conditions and trigger the bloom when conditions improve (Chapter 1). From a spatial scale, hydrodynamic factors mainly drove high local salp abundances, although biological variables (predator abundance) had secondary importance (Chapter 2). We observed the coexistence of contrasting diel vertical migration (DVM) patterns in a salp (nocturnal and diurnal migrations), which explains controversial conclusions in previous studies, but brings new questions about the drivers of DVM in salps (Chapter 3). The two species found produced contrasting trophic impacts: Thalia democratica was less abundant and its effect on the ecosystem seemed to be negligible while, Salpa fusiformis ingested a maximum of 69.92 mg C m-2 day-1 and defecated 35.76 mg C m-2 day-1, contributing to the transport of organic matter to the deep ocean (Chapter 2). Our findings contribute to general knowledge in salp ecology. They lead us to consider evolutionary demographic studies to understand the potential benefits of their life cycle as an adaptation to environmental change and the mechanisms which maintain genetic variability after bloom-latency periods.
Les salpes són tunicats pelàgics marins que han desenvolupat característiques oportunistes per a proliferar quan les condicions són favorables i mantenir-la en períodes adversos. Les altes abundàncies assolides durant un bloom, en combinació amb els seus mecanismes d’alimentació altament eficients, tenen un efecte notable pels ecosistemes així com per a la societat. Tot i que els blooms de salpes són comuns a la costa catalana durant primavera i tardor, les seves causes i el seu paper en l’ecosistema no s’han estudiat mai al mar Català. L’objectiu general de la present tesi és entendre els processos espacials i temporals que condueixen a formar les agregacions de salpes i estimar el seu paper en el mar Català, nord-oest del Mediterrani. Per assolir aquesta fita, s’han combinat models mecanístics (models matricials) i estadístics (GAMs) amb observacions in situ que ens han permès proposar els mecanismes més simples que expliquen el desenvolupament d’un bloom. Hem vist que canvis en la reproducció de les femelles serien els responsables del fre del creixement poblacional durant el període de latència i el detonador del bloom quan les condicions es tornen favorables (Capítol 1). Des d’un punt de vista espacial, l’abundància local de salpes està influenciada principalment per factors físics tot i que les variables biològiques juguen un paper secundari (Capítol 2). Per primer cop s’ha observat la coexistència de patrons diferents de migració vertical diürna (DVM) en una salpa (migració diürna i nocturna en Salpa fusiformis), la qual cosa explica les conclusions contradictòries d’estudis anteriors, però obre noves preguntes sobre els mecanismes de la DVM en salpes. Les dues especies presents en l’estudi produïren impactes tròfics molt diferents: l’impacte de Thalia democratica, va ser quasi negligible degut a la seva baixa abundància mentre que S. fusiformis va ingerir un màxim de 69.92 mgC m-2 dia-1 i defecar 35.76 mgC m-2 dia-1, incrementant considerablement el flux de matèria orgànica cap a l’oceà profund (Capítol 2). Els resultats d’aquesta tesi contribueixen a l’ecologia general de les salpes i ens han portat a la necessitat de plantejar estudis de demografia evolutiva per entendre l’efecte del seu cicle de vida en l’adaptació de la població a canvis ambientals i en el manteniment de la variabilitat genètica entre períodes de latència-bloom.
APA, Harvard, Vancouver, ISO, and other styles
4

Salb, Katharina [Verfasser], Jens [Akademischer Betreuer] Schlossmann, and Achim [Akademischer Betreuer] Göpferich. "Funktion von IRAG für cGMP-Kinase-I-Komplexe sowie für die InsP3R-I-Phosphorylierung / Katharina Salb. Betreuer: Jens Schlossmann ; Achim Göpferich." Regensburg : Universitätsbibliothek Regensburg, 2011. http://d-nb.info/1025386124/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hoffmann, Julia Verfasser], and Gülsah [Akademischer Betreuer] [Gabriel. "In vitro und in vivo Untersuchungen zur inhibitorischen Aktivität von synthetischen Anti-Lipopolysaccharid Peptiden (SALP) gegen Influenza A Viren / Julia Hoffmann. Betreuer: Gülsah Gabriel." Hamburg : Staats- und Universitätsbibliothek Hamburg, 2014. http://d-nb.info/1054422451/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Salb, Sandra Verfasser], Herbert [Akademischer Betreuer] Hopf, Andreas [Akademischer Betreuer] Bund, and Gerd [Akademischer Betreuer] [Thienes. "Wahrnehmung und Vorstellung von Bewegungen - Studien im Kontext des Erwerbs sportlicher Fertigkeiten in der Kindheit / Sandra Salb. Gutachter: Andreas Bund ; Gerd Thienes. Betreuer: Herbert Hopf." Göttingen : Niedersächsische Staats- und Universitätsbibliothek Göttingen, 2015. http://d-nb.info/1065882378/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Salb, Nicole [Verfasser], and Peter [Akademischer Betreuer] Nelson. "Application of engineered mesenchymal stem cells as therapeutic vehicles for the treatment of solid tumors : HIF1α-based targeting and the influence of thyroid hormones / Nicole Salb ; Betreuer: Peter Nelson." München : Universitätsbibliothek der Ludwig-Maximilians-Universität, 2018. http://d-nb.info/1171131372/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Le, Guen Vincent. "Exploration de la diversité des résistances génétiques à la maladie sud-américaine des feuilles de l'hévéa (Microcyclus ulei) par cartographie et génétique d'association au sein de populations naturelles." Phd thesis, Université Montpellier II - Sciences et Techniques du Languedoc, 2008. http://tel.archives-ouvertes.fr/tel-00564595.

Full text
Abstract:
Menace potentielle pour l'hévéaculture mondiale, la maladie sud-américaine des feuilles de l'hévéa provoquée par le champignon Microcyclus ulei est aussi responsable du faible développement de cette culture en Amérique latine. La sélection de variétés résistantes est privilégiée pour anticiper une apparition accidentelle de la maladie dans les pays encore épargnés et pour développer la culture de l'hévéa dans les zones infestées. La principale source de résistance décrite jusqu'à présent n'est pas fonctionnelle face à des isolats très agressifs du champignon. Une autre source de résistance identifiée chez un cultivar originaire du Pérou se maintient depuis plus de trente ans en conditions de forte infestation. La cartographie génétique réalisée sur la descendance de ce cultivar en croisement révèle l'existence de deux gènes majeurs de résistance, l'un situé sur le groupe de liaison g15 et efficace contre les isolats de Guyane et l'autre sur le groupe de liaison g13 efficace vis-à-vis des isolats de l'état de Bahia. L'analyse de la diversité des populations naturelles du sud-ouest Amazonien fait apparaître une structure en trois groupes principaux recouvrant les états brésiliens de l'Acre, du Rondônia et du Mato Grosso. La population Madre de Dios au Pérou est rattachée au groupe de l'Acre. La différentiation entre les populations est expliquée principalement par l'isolement par la distance et secondairement par l'existence de bassins hydrographiques. Le déséquilibre de liaison entre marqueurs liés est plus étendu dans le groupe Acre que dans le groupe Rondônia, mais reste faible dans les deux cas. Une association avec le caractère de résistance à M. ulei est détectée avec un marqueur microsatellite situé à proximité du gène majeur de résistance du groupe de liaison g15. Une autre association est détectée dans une portion du génome où aucun locus de résistance n'était identifié jusqu'à présent. L'importance de ces résultats pour la sélection de nouveaux cultivars résistants à M. ulei est discutée.
APA, Harvard, Vancouver, ISO, and other styles
9

CHRUDIMSKÁ, Tereza. "Identifikace a charakterizace diferenciálně exprimovaných genů pro SALP 14 a SALP 15 u klíštěte \kur{Ixodes ricinus}." Master's thesis, 2007. http://www.nusl.cz/ntk/nusl-44047.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lee, Amy. "The Effects of Salvia hispanica L. (Salba) on Postprandial Glycemia and Subjective Appetite." Thesis, 2009. http://hdl.handle.net/1807/17437.

Full text
Abstract:
Dietary interventions have been attempted to lower the risk of obesity, diabetes and CVD by the reduction of postprandial hyperglycemia and prevention of excess caloric intake. Evidence suggests an independent predictive role of postprandial glycemia for CVD. Furthermore, due to the possible role of obesity in the development of CVD and T2D, research has focused on appetite suppression to reduce excessive food intake. Here we investigate the ability of the novel oil-rich grain Salvia hispanica L. (Salba) to lower postprandial glycemia and reduce appetite when added to a carbohydrate meal. In our first study, we investigated the effects of Salba in escalating doses on both parameters in healthy individuals. In our second study we compared the effectiveness of ground and whole forms of Salba on the same parameters. Results confirmed our hypotheses, as Salba given in either form positively affected postprandial glycemia and mildly suppressed
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "SALBP"

1

Petra, Maria. Salba de lut: Sonete. Iași: Junimea, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhalil, Abdulla. Tŭqqizinchi salb i︠u︡rish: Publit︠s︡istik maqolalar. Toshkent: Ŭzbekiston Respublikasi fanlar akademii︠a︡si "Fan" nashriëti, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Auchmuty, S. Forbes F. The history of the parish of Cleobury Mortimer, Salop. Cleobury Mortimer: M & M Baldwin, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lāo, Kānbin. Salup phonngān pī 1999 læ khư̄n phǣnkān pī 2000. [Vientiane, Laos]: Kasūang Khommanākhom, Khonsong, Paisanī, læ Kō̜sāng, Latvisāhakit Kānbin Lāo, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lengsavat, Somsavāt. Salup 25 pī kānpīanpǣng mai yū Sō̜Pō̜Pō̜ Lāo: 1986-2010. Vīangchan: Sathāban Vitthayāsāt Sangkhom hæng Sāt, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

ʻŌlabūn, Mūnkǣo. Vīakngān kānmư̄ang nǣokhit vatthanatham tō̜ng lœmchāk kānkhonkhwā thitsadī læ salup phuttikam. Vīangchan: Samnakphim læ Chamnāi Pư̄m hæng Lat, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Suliyasǣng, ʻAi. Salup songkhām pativat potpo̜i sāt khō̜ng kō̜ngthap læ pasāson Lāo, 1945-1975. [Vientiane]: Kasūang Pō̜ngkan Pathēt, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Salb-i mālikīyat az bīgānagān dar ḥuqūq-i bayn al-milal. Tihrān: Nashr-i Dādgustar, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lōhitkun, Thīraphāp. Mǣnām Čhaophrayā: Banthưk bư̄anglang ngān thāitham sārakhadī lōk salap sī chut mǣnām Čhaophrayā. Krung Thēp: Samnakphim Na Bāng Wannakam, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Salbu chŏngsin kwa siindŭl: Pyŏn Ŭi-su ŭi hyŏndaesi yŏn'gu : Che-3 pip'yŏngjip. Kyŏnggi-do P'aju-si: Han'guk Haksul Chŏngbo, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "SALBP"

1

Bock, Stefan. "Einsatz verteilter Algorithmen zur Lösung von SALBP-Modellen." In Modelle und verteilte Algorithmen zur Planung getakteter Fließlinien, 245–319. Wiesbaden: Deutscher Universitätsverlag, 2000. http://dx.doi.org/10.1007/978-3-322-92330-1_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bährle-Rapp, Marina. "Salbe." In Springer Lexikon Kosmetik und Körperpflege, 486. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-71095-0_9072.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Houssein, Essam H., Ibrahim E. Mohamed, and Aboul Ella Hassanien. "Salp Swarm Algorithm: Tutorial." In Swarm Intelligence Algorithms, 279–92. First edition. | Boca Raton : Taylor and Francis, 2020.: CRC Press, 2020. http://dx.doi.org/10.1201/9780429422614-21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Teoh, Eng Soon. "An Ancient Fantasy: Salep as Aphrodisiac." In Orchids as Aphrodisiac, Medicine or Food, 13–54. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-18255-7_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bobis, Merlinda. "Salba Istorya/Salba Buhay: Save Story/Save Life: Collaborative Storying in the Wake of Typhoons." In Tracking the Literature of Tropical Weather, 151–76. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-41516-1_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Houssein, Essam H., Ibrahim E. Mohamed, and Aboul Ella Hassanien. "Salp Swarm Algorithm: Modification and Application." In Swarm Intelligence Algorithms, 285–99. First edition. | Boca Raton : Taylor and Francis, 2020.: CRC Press, 2020. http://dx.doi.org/10.1201/9780429422607-21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Houssein, Essam H., Ibrahim E. Mohamed, and Yaser M. Wazery. "Salp Swarm Algorithm: A Comprehensive Review." In Applications of Hybrid Metaheuristic Algorithms for Image Processing, 285–308. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-40977-7_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ibrahim, Abdelhameed, Ali Ahmed, Sherif Hussein, and Aboul Ella Hassanien. "Fish Image Segmentation Using Salp Swarm Algorithm." In The International Conference on Advanced Machine Learning Technologies and Applications (AMLTA2018), 42–51. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-74690-6_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Arunekumar, N. B., and K. Suresh Joseph. "Skip Salp Swam Algorithm for Feature Selection." In Information and Communication Technology for Competitive Strategies (ICTCS 2020), 231–40. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-0739-4_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bairathi, Divya, and Dinesh Gopalani. "Opposition Based Salp Swarm Algorithm for Numerical Optimization." In Advances in Intelligent Systems and Computing, 821–31. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-16660-1_80.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "SALBP"

1

Ismail, Mohamed, Sayed Kaes Hossain, and Ola Rashwan. "A Novel Algorithm for Solving the Assembly Line Balancing Type I Problem." In ASME 2017 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/imece2017-72092.

Full text
Abstract:
This paper presents a new modeling approach called Progressive Modeling (PM) and demonstrates it by solving the Assembly Line Balancing Type I Problem. PM introduces some new concepts that make the modeling process of large-scale complex industrial problems more systematic and their solution algorithms much faster and easily maintained. In the context of SALBP-I, PM introduces a component model to deploy the problem logic and its solution algorithm into several interacting components. The problem is represented as an object-oriented graph G (V, E, W) of vertices, edges, and workstations which enables problem solutions to start anywhere. The novel representation relaxes the only forward and backward tracking approach used in the assembly line balancing literature. A set of well-reported problems in the literature are reported and solved. The paper concludes by demonstrating the efficiency of the new modeling approach and future extensions.
APA, Harvard, Vancouver, ISO, and other styles
2

Mozdgir, A., Iraj Mahdavi, I. Seyyedi, M. E. Shiraqei, Nader Barsoum, Jeffrey Frank Webb, and Pandian Vasant. "Using Taguchi method to optimize differential evolution algorithm parameters to minimize workload smoothness index in SALBP." In PROCEEDINGS OF THE FOURTH GLOBAL CONFERENCE ON POWER CONTROL AND OPTIMIZATION. AIP, 2011. http://dx.doi.org/10.1063/1.3592475.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kumar, Sandeep, Rajani Kumari, and Anand Nayyar. "Sigmoidal Salp Swarm Algorithm." In 2020 International Conference on Artificial Intelligence, Big Data, Computing and Data Communication Systems (icABCD). IEEE, 2020. http://dx.doi.org/10.1109/icabcd49160.2020.9183825.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Xiao, Bingsong, Rui Wang, Yang Xu, Jundi Wang, Wenjun Song, and Youwei Deng. "Simplified Salp Swarm Algorithm." In 2019 IEEE International Conference on Artificial Intelligence and Computer Applications (ICAICA). IEEE, 2019. http://dx.doi.org/10.1109/icaica.2019.8873515.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pandey, Avinash Chandra, Ashish Kumar Tripathi, Raju Pal, Himanshu Mittal, and Mukesh Saraswat. "Spiral Salp Swarm Optimization Algorithm." In 2019 4th International Conference on Information Systems and Computer Networks (ISCON). IEEE, 2019. http://dx.doi.org/10.1109/iscon47742.2019.9036293.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pelusi, Danilo, Raffaele Mascella, and Luca Tallini. "A fitness dependent salp swarm algorithm." In 2020 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2020. http://dx.doi.org/10.1109/cec48606.2020.9185594.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kumar, Anand, Roshan Singhi, Soumyabrata Das, Tanmoy Malakar, Om Prakash, and Priti Das. "Economic Load Dispatch Using Salp Swarm Algorithm." In 2020 IEEE 9th Power India International Conference (PIICON). IEEE, 2020. http://dx.doi.org/10.1109/piicon49524.2020.9112882.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Saha, Dip Kumar, and Supriya Dhabal. "Medical Image Enhancement using Salp Swarm Algorithm." In 2020 IEEE International Conference for Convergence in Engineering (ICCE). IEEE, 2020. http://dx.doi.org/10.1109/icce50343.2020.9290659.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Elkassas, Ahmed M., and Mohamed ElWakil. "Facility Layout Problem Using Salp Swarm Algorithm." In 2019 6th International Conference on Control, Decision and Information Technologies (CoDIT). IEEE, 2019. http://dx.doi.org/10.1109/codit.2019.8820422.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Xiao, Bingsong, Rui Wang, Yang Xu, Wenjun Song, Jundi Wang, and Youli Wu. "Salp swarm algorithm based on particle-best." In 2019 IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC). IEEE, 2019. http://dx.doi.org/10.1109/itnec.2019.8729243.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'SALBP' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography