Relevant bibliographies by topics / Permutacional Flowshop Scheduling Problem

Contents

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

Academic literature on the topic 'Permutacional Flowshop Scheduling Problem'

Author: Grafiati
Published: 4 June 2021
Last updated: 11 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 'Permutacional Flowshop Scheduling Problem.'

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 "Permutacional Flowshop Scheduling Problem"

1

Eren, Tamer, and Ertan Güner. "The tricriteria flowshop scheduling problem." International Journal of Advanced Manufacturing Technology 36, no. 11-12 (February 16, 2007): 1210–20. http://dx.doi.org/10.1007/s00170-007-0931-1.

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

Gupta, Jatinder N. D. "Two-Stage, Hybrid Flowshop Scheduling Problem." Journal of the Operational Research Society 39, no. 4 (April 1988): 359. http://dx.doi.org/10.2307/2582115.

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

Haouari, Mohamed, and Lotfi Hidri. "On the hybrid flowshop scheduling problem." International Journal of Production Economics 113, no. 1 (May 2008): 495–97. http://dx.doi.org/10.1016/j.ijpe.2007.10.007.

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

Yang, Dar-Li, and Maw-Sheng Chern. "Two-machine flowshop group scheduling problem." Computers & Operations Research 27, no. 10 (September 2000): 975–85. http://dx.doi.org/10.1016/s0305-0548(99)00070-2.

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

Gupta, Jatinder N. D. "Two-Stage, Hybrid Flowshop Scheduling Problem." Journal of the Operational Research Society 39, no. 4 (April 1988): 359–64. http://dx.doi.org/10.1057/jors.1988.63.

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

Naderi, B., and Rubén Ruiz. "The distributed permutation flowshop scheduling problem." Computers & Operations Research 37, no. 4 (April 2010): 754–68. http://dx.doi.org/10.1016/j.cor.2009.06.019.

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

Tang, Dan, and Hong Ping Shu. "A Heuristic Algorithm for Flowshop Scheduling Problem." Advanced Materials Research 591-593 (November 2012): 626–30. http://dx.doi.org/10.4028/www.scientific.net/amr.591-593.626.

Full text
Abstract:
Flow Shop Scheduling Problem is a class of scheduling problems with a work shop in which the flow control shall enable an appropriate sequencing for each job and for processing on a set of machines in compliance with given processing orders. In this paper, we propose a new heuristic algorithm based on the analysis and research of which problem, the new method introducing a evaluate mechanism of the relative position of any two jobs to the completion time, and the efficiency and performance has been improved .The result of simulation experiments shows that, our new heuristic algorithm has good performance, and the average quality and stability of scheduling sequences generated by new method is significantly better than other heuristic algorithm which has the same complexity.
APA, Harvard, Vancouver, ISO, and other styles
8

Rajendran, Chandrasekharan. "Two-Stage Flowshop Scheduling Problem with Bicriteria." Journal of the Operational Research Society 43, no. 9 (September 1992): 871. http://dx.doi.org/10.2307/2583288.

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

Sadjadi, S. J., M. B. Aryanezhad, and Mohsen Ziaee. "The General Flowshop Scheduling Problem: Mathematical Models." Journal of Applied Sciences 8, no. 17 (August 15, 2008): 3032–37. http://dx.doi.org/10.3923/jas.2008.3032.3037.

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

ZHANG, Chang-Sheng, Ji-Gui SUN, Qing-Yun YANG, and Li-Hui ZHENG. "A Hybrid Algorithm for Flowshop Scheduling Problem." Acta Automatica Sinica 35, no. 3 (May 31, 2009): 332–36. http://dx.doi.org/10.3724/sp.j.1004.2009.00332.

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

Dissertations / Theses on the topic "Permutacional Flowshop Scheduling Problem"

1

Gomes, Francisco Regis Abreu. "Algoritimo genÃtico aplicado aos problema de seqÃenciamento permutacional flowshop sem e com restriÃÃo de espera." Universidade Federal do CearÃ, 2008. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1220.

Full text
Abstract:
CoordenaÃÃo de AperfeiÃoamento de NÃvel Superior
Neste trabalho foram tratados dois problemas: o primeiro à denominado Continuous Permutation Flowshop Scheduling Problem (CPFSP), que possui a restriÃÃo de que nenhuma tarefa pode esperar por processamento entre mÃquinas consecutivas; o segundo à denominado de Permutation Flowshop Scheduling Problem (PFSP), em que a restriÃÃo anterior nÃo existe. A metaheurÃstica Algoritmo GenÃtico (AG) tem sido aplicada com sucesso ao PFSP, mas atà o momento nÃo foi encontrado na literatura algo que mostre que o AG à um bom mÃtodo para o CPFSP. O objetivo deste trabalho foi desenvolver um AG eficiente paras esses dois problemas, mas que nÃo precisa utilizar inicializaÃÃo eficiente e/ou hibridizaÃÃo com outra tÃcnica de busca. O desenvolvimento do AG proposto levou em consideraÃÃo as caracterÃsticas, diversificaÃÃo e a intensificaÃÃo, que inspiraram a criaÃÃo de trÃs procedimentos que melhoraram o desempenho do AG proposto. Foram realizados vÃrios experimentos com as instÃncias de Taillard (1993), Reeves (1995) e Heller (1960). Os resultados foram comparados com outros mÃtodos encontrados na literatura. Foram construÃdos polinÃmios com a utilizaÃÃo de InterpolaÃÃo Lagrangeana para determinar o tempo execuÃÃo do AG proposto. Por fim, o mÃtodo foi aplicado num problema real. Os resultados mostraram que o AG proposto à o melhor mÃtodo para o CPFSP e que fica muito prÃximo do melhor AG encontrado na literatura com inicializaÃÃo eficiente para o PFSP
APA, Harvard, Vancouver, ISO, and other styles
2

Ibrahem, Al-mehdi Mohamed M. "Scheduling optimization of cellular flowshop with sequence dependent setup times." Proceedings of the 47th CIRP Conference on Manufacturing Systems, 2014. http://hdl.handle.net/1993/30730.

Full text
Abstract:
In cellular manufacturing systems, minimization of the completion time has a great impact on the production time, material flow, and productivity. An effective scheduling is crucial to attaining the advantages of cellular manufacturing systems. This dissertation attempts to solve the Flowshop Manufacturing Cell (cellular flowshop) Scheduling Problem with Sequence Dependent Setup Times (FMCSP with SDSTs) considering two performance measures: the total flow time as a mono objective, and the makespan and total flow time combined as a bi-criteria scheduling problem. The proposed problem is known to be the NP-hard problem because of its complexity. Several metaheuristic algorithms based on Genetic Algorithm (GA), Simulated Annealing (SA), and Particle Swarm Optimization (PSO) are developed for scheduling part families as well as jobs within each part family for FMCSP with SDSTs to minimize the total flow time. A local search method based on SA combined with PSO (named as PSO-SA) is proposed to enhance the intensification and improve the quality of the solution obtained by pure PSO. The effectiveness and efficiency of the proposed metaheuristics are evaluated based on the Relative Percentage Deviation (RPD) from its lower bound, and the robustness. Results indicate PSO-SA is performed similar to best available algorithms for small and medium size test problems. Yet, there is a very small deviation from best results for large problems. A Multi-objective Particle Swarm Optimization (MPSO) and a Multi-objective Simulated Annealing (MOSA) Algorithm are further proposed to solve the bi-criteria optimization problem to minimize the total flow time and makespan simultaneously. An improved PSO is combined with Threshold Acceptance (TA) algorithm to improve effectiveness of the proposed MPSO (named as IMPSO-TA) for the convergence of the obtained Pareto Front. The proposed algorithms are evaluated using several Quality Indicators (QI) measures for multiobjective optimization problems. The proposed algorithms can generate approximated Pareto Fronts in a reasonable CPU time. The proposed IMPSO-SA outperforms MOSA algorithm in terms of CPU time and minimizing the objective functions.
October 2015
APA, Harvard, Vancouver, ISO, and other styles
3

Hatami, Sara. "The Distributed and Assembly Scheduling Problem." Doctoral thesis, Universitat Politècnica de València, 2016. http://hdl.handle.net/10251/64072.

Full text
Abstract:
[EN] Nowadays, manufacturing systems meet different new global challenges and the existence of a collaborative manufacturing environment is essential to face with. Distributed manufacturing and assembly systems are two manufacturing systems which allow industries to deal with some of these challenges. This thesis studies a production problem in which both distributed manufacturing and assembly systems are considered. Although distributed manufacturing systems and assembly systems are well-known problems and have been extensively studied in the literature, to the best of our knowledge, considering these two systems together as in this thesis is the first effort in the literature. Due to the importance of scheduling optimization on production performance, some different ways to optimize the scheduling of the considered problem are discussed in this thesis. The studied scheduling setting consists of two stages: A production and an assembly stage. Various production centers make the first stage. Each of these centers consists of several machines which are dedicated to manufacture jobs. A single assembly machine is considered for the second stage. The produced jobs are assembled on the assembly machine to form final products through a defined assembly program. In this thesis, two different problems regarding two different production configurations for the production centers of the first stage are considered. The first configuration is a flowshop that results in what we refer to as the Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP). The second problem is referred to as the Distributed Parallel Machine and Assembly Scheduling Problem (DPMASP), where unrelated parallel machines configure the production centers. Makespan minimization of the product on the assembly machine located in the assembly stage is considered as the objective function for all considered problems. In this thesis some extensions are considered for the studied problems so as to bring them as close as possible to the reality of production shops. In the DAPFSP, sequence dependent setup times are added for machines in both production and assembly stages. Similarly, in the DPMASP, due to technological constraints, some defined jobs can be processed only in certain factories. Mathematical models are presented as an exact solution for some of the presented problems and two state-of-art solvers, CPLEX and GUROBI are used to solve them. Since these solvers are not able to solve large sized problems, we design and develop heuristic methods to solve the problems. In addition to heuristics, some metaheuristics are also designed and proposed to improve the solutions obtained by heuristics. Finally, for each proposed problem, the performance of the proposed solution methods is compared through extensive computational and comprehensive ANOVA statistical analysis.
[ES] Los sistemas de producción se enfrentan a retos globales en los que el concepto de fabricación colaborativa es crucial para poder tener éxito en el entorno cambiante y complejo en el que nos encontramos. Una característica de los sistemas productivos que puede ayudar a lograr este objetivo consiste en disponer de una red de fabricación distribuida en la que los productos se fabriquen en localizaciones diferentes y se vayan ensamblando para obtener el producto final. En estos casos, disponer de modelos y herramientas para mejorar el rendimiento de sistemas de producción distribuidos con ensamblajes es una manera de asegurar la eficiencia de los mismos. En esta tesis doctoral se estudian los sistemas de fabricación distribuidos con operaciones de ensamblaje. Los sistemas distribuidos y los sistemas con operaciones de ensamblaje han sido estudiados por separado en la literatura. De hecho, no se han encontrado estudios de sistemas con ambas características consideradas de forma conjunta. Dada la complejidad de considerar conjuntamente ambos tipos de sistemas a la hora de realizar la programación de la producción en los mismos, se ha abordado su estudio considerando un modelo bietápico en la que en la primera etapa se consideran las operaciones de producción y en la segunda se plantean las operaciones de ensamblaje. Dependiendo de la configuración de la primera etapa se han estudiado dos variantes. En la primera variante se asume que la etapa de producción está compuesta por sendos sistemas tipo flowshop en los que se fabrican los componentes que se ensamblan en la segunda etapa (Distributed Assembly Permutation Flowshop Scheduling Problem o DAPFSP). En la segunda variante se considera un sistema de máquinas en paralelo no relacionadas (Distributed Parallel Machine and Assembly Scheduling Problem o DPMASP). En ambas variantes se optimiza la fecha de finalización del último trabajo secuenciado (Cmax) y se contempla la posibilidad que existan tiempos de cambio (setup) dependientes de la secuencia de trabajos fabricada. También, en el caso DPMASP se estudia la posibilidad de prohibir o no el uso de determinadas máquinas de la etapa de producción. Se han desarrollado modelos matemáticos para resolver algunas de las variantes anteriores. Estos modelos se han resuelto mediante los programas CPLEX y GUROBI en aquellos casos que ha sido posible. Para las instancias en los que el modelo matemático no ofrecía una solución al problema se han desarrollado heurísticas y metaheurísticas para ello. Todos los procedimientos anteriores han sido estudiados para determinar el rendimiento de los diferentes algoritmos planteados. Para ello se ha realizado un exhaustivo estudio computacional en el que se han aplicado técnicas ANOVA. Los resultados obtenidos en la tesis permiten avanzar en la comprensión del comportamiento de los sistemas productivos distribuidos con ensamblajes, definiendo algoritmos que permiten obtener buenas soluciones a este tipo de problemas tan complejos que aparecen tantas veces en la realidad industrial.
[CAT] Els sistemes de producció s'enfronten a reptes globals en què el concepte de fabricació col.laborativa és crucial per a poder tindre èxit en l'entorn canviant i complex en què ens trobem. Una característica dels sistemes productius que pot ajudar a aconseguir este objectiu consistix a disposar d'una xarxa de fabricació distribuïda en la que els productes es fabriquen en localitzacions diferents i es vagen acoblant per a obtindre el producte final. En estos casos, disposar de models i ferramentes per a millorar el rendiment de sistemes de producció distribuïts amb acoblaments és una manera d'assegurar l'eficiència dels mateixos. En esta tesi doctoral s'estudien els sistemes de fabricació distribuïts amb operacions d'acoblament. Els sistemes distribuïts i els sistemes amb operacions d'acoblament han sigut estudiats per separat en la literatura però, en allò que es coneix, no s'han trobat estudis de sistemes amb ambdós característiques conjuntament. Donada la complexitat de considerar conjuntament ambdós tipus de sistemes a l'hora de realitzar la programació de la producció en els mateixos, s'ha abordat el seu estudi considerant un model bietàpic en la que en la primera etapa es consideren les operacions de producció i en la segona es plantegen les operacions d'acoblament. Depenent de la configuració de la primera etapa s'han estudiat dos variants. En la primera variant s'assumix que l'etapa de producció està composta per sengles sistemes tipus flowshop en els que es fabriquen els components que s'acoblen en la segona etapa (Distributed Assembly Permutation Flowshop Scheduling Problem o DAPFSP). En la segona variant es considera un sistema de màquines en paral.lel no relacionades (Distributed Parallel Machine and Assembly Scheduling Problem o DPMASP). En ambdós variants s'optimitza la data de finalització de l'últim treball seqüenciat (Cmax) i es contempla la possibilitat que existisquen temps de canvi (setup) dependents de la seqüència de treballs fabricada. També, en el cas DPMASP s'estudia la possibilitat de prohibir o no l'ús de determinades màquines de l'etapa de producció. S'han desenvolupat models matemàtics per a resoldre algunes de les variants anteriors. Estos models s'han resolt per mitjà dels programes CPLEX i GUROBI en aquells casos que ha sigut possible. Per a les instàncies en què el model matemàtic no oferia una solució al problema s'han desenrotllat heurístiques i metaheurísticas per a això. Tots els procediments anteriors han sigut estudiats per a determinar el rendiment dels diferents algoritmes plantejats. Per a això s'ha realitzat un exhaustiu estudi computacional en què s'han aplicat tècniques ANOVA. Els resultats obtinguts en la tesi permeten avançar en la comprensió del comportament dels sistemes productius distribuïts amb acoblaments, definint algoritmes que permeten obtindre bones solucions a este tipus de problemes tan complexos que apareixen tantes vegades en la realitat industrial.
Hatami, S. (2016). The Distributed and Assembly Scheduling Problem [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/64072
TESIS
APA, Harvard, Vancouver, ISO, and other styles
4

Ayodele, Mayowa. "Effective and efficient estimation of distribution algorithms for permutation and scheduling problems." Thesis, Robert Gordon University, 2018. http://hdl.handle.net/10059/3102.

Full text
Abstract:
Estimation of Distribution Algorithm (EDA) is a branch of evolutionary computation that learn a probabilistic model of good solutions. Probabilistic models are used to represent relationships between solution variables which may give useful, human-understandable insights into real-world problems. Also, developing an effective PM has been shown to significantly reduce function evaluations needed to reach good solutions. This is also useful for real-world problems because their representations are often complex needing more computation to arrive at good solutions. In particular, many real-world problems are naturally represented as permutations and have expensive evaluation functions. EDAs can, however, be computationally expensive when models are too complex. There has therefore been much recent work on developing suitable EDAs for permutation representation. EDAs can now produce state-of-the-art performance on some permutation benchmark problems. However, models are still complex and computationally expensive making them hard to apply to real-world problems. This study investigates some limitations of EDAs in solving permutation and scheduling problems. The focus of this thesis is on addressing redundancies in the Random Key representation, preserving diversity in EDA, simplifying the complexity attributed to the use of multiple local improvement procedures and transferring knowledge from solving a benchmark project scheduling problem to a similar real-world problem. In this thesis, we achieve state-of-the-art performance on the Permutation Flowshop Scheduling Problem benchmarks as well as significantly reducing both the computational effort required to build the probabilistic model and the number of function evaluations. We also achieve competitive results on project scheduling benchmarks. Methods adapted for solving a real-world project scheduling problem presents significant improvements.
APA, Harvard, Vancouver, ISO, and other styles
5

Mangione, Fabien. "Ordonnancement des ateliers de traitement de surface pour une production cyclique et mono-produit." Phd thesis, Grenoble INPG, 2003. http://tel.archives-ouvertes.fr/tel-00138820.

Full text
Abstract:
Cette thèse traite des lignes de traitement de surface qui sont des lignes dans lesquelles les pièces sont immergées dans une succession de cuves. Chaque cuve contient des bains qui affectent les propriétés mécaniques ou électriques des pièces. Ce type de ligne est utilisé, par exemple, pour la galvanoplastie. Les pièces sont montées sur des porteurs et transportées d'une cuve à l'autre par un robot. Le temps opératoire (ou temps pendant lequel la pièce reste dans la cuve) est borné. La borne inférieure est le temps minimum qui permet le traitement et la borne supérieure dépend du type de traitement (attaque acide, rinçage...).
Un objectif classique est de trouver les mouvements du robot qui maximisent la productivité, ce problème est communément appelé “hoist scheduling problem” (HSP). Lors de ce travail nous nous sommes attachés à une production cyclique. Nous avons proposé dans le cas d'une ligne à deux cuves une méthode permettant d'obtenir les cycles optimaux. Nous avons démontré, pour le cas d'une ligne équilibrée à trois cuves pour une production mono-produit, les caractéristiques des cycles optimaux ainsi qu'une méthode pour les obtenir. Ensuite, nous avons étudié le problème sur quatre machines dans le cas où les temps de trempe sont égaux et sans attente. Nous avons proposé les cycles optimaux dans le cas d'une production mono-produit. Enfin nous avons proposé une conjecture sur les cycles optimaux et en avons démontré certaines parties, dans le cas d'une ligne équilibrée avec un nombre de cuves quelconque et où les marges sur les temps de process sont nulles.
APA, Harvard, Vancouver, ISO, and other styles
6

Yang, Dar-Li, and 楊達立. "Some Generalized Two-Machine Flowshop Scheduling Problem." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/66011464809492698777.

Full text
Abstract:
博士
國立清華大學
工業工程研究所
82
Since Johnson, in his pioneering work, proposed a polynominal time algorithm for the two-machine flowshop scheduling problem. The flowshop scheduling problems have been studied extensively. However, due to the simplicity of the convertional models, they can not be successfully implemented in some practical scheduling problem with reprocessing operations, the scheduling problem with limited waiting time constraints, the scheduling problem with processing time linearly dependent on job waitting- time. These extensions have some practical applications in bridge construction , semiconductor manufacturing, metallurgical process, food production and chemical industry. We show that these problems are Np-hard. We also derive some theoretical results and propose some efficient algorithms for solving them.
APA, Harvard, Vancouver, ISO, and other styles
7

Lin, Zhi-Yu, and 林志諭. "Genetic algorithm for multi-objective flowshop scheduling problem." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/15601955448224589260.

Full text
Abstract:
碩士
國立勤益科技大學
工業工程與管理系
97
This paper explores the Pareto optimal solutions for solving multi-objective combinatorial optimization problems. It is necessary to consider the convergence and diversity. This paper proposes a heuristic, LH algorithm, based on Genetic algorithm (GA) for flowshop scheduling problem with multiple objectives of minimizing makespan, total tardiness and total flow time. The algorithm can provide efficient Pareto optimal solutions for decision makers’ reference. Firstly, it refers NEH and modified NEH algorithms to produce several good initial solutions. For searching the whole solution space, the paper applies the gradual-priority weighting approach to determine the objective function and fitness value. Meanwhile, the algorithm avoids the generation converge too early, so presents an intensification mechanism of some new solutions generation. This paper constructs three solution sets to record three objectives individually. The experimental results show that the proposed algorithm can find more effective solutions than an existed GA-based algorithm. The related error percentages of individual objective and combined objectives are superior.
APA, Harvard, Vancouver, ISO, and other styles
8

Hsiu-Hsiu, Weng, and 翁秀繡. "Genetic Algorithm for Two-stage Hybrid Flowshop scheduling problem." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/34156437397140462245.

Full text
Abstract:
碩士
國立勤益科技大學
工業工程與管理系
97
Several production lines are hybrid flowshop, which are mixed two production systems of flowshop and parallel machines. The machine preventive maintenance or adjustment is needed in a specified period of time, therefore the machine is not available. The two-stage hybrid flowshop includes several machines in each stage and preventive maintenance or adjustment us considered. The paper proposes a heuristic based on gentic algorithm (GA), named GA_H algorithm to minimize makespan.The initial solution of GA_H algorithm are combination JR、SPT、NEH、NEH_R(r) algorithm and LPT, FAM rules. The paper selects some excellent solution to reproduce the next generation through adaptive selection、crossover and mutation. In order to avoid premature convergence in search procedure, a restart mechanism is used to explore a new solution region. The experimental results show that GA_H algorithm is better than MLJLF algorithm, and the ARP and ARPLB are 3.02% and 1.31%, respectively. The performance of GA_H algorithm is superity.
APA, Harvard, Vancouver, ISO, and other styles
9

Hao-tun, Teng, and 鄧浩敦. "A Hybrid Genetic Algorithm for the Flowshop Scheduling Problem." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/46941160360681385525.

Full text
Abstract:
碩士
逢甲大學
工業工程學系
88
In past, while studying the flowshop scheduling problem, it is generally assumed that all jobs are equal in importance. In reality, such an assumption need not necessarily hold. For example, jobs have different unit costs and holding costs, and hence they cannot be treated equivalently. In order to solve the problem, in this paper, we study the flowshop scheduling problem with respect to minimizing the total weighted flowtime of jobs. Genetic algorithm has been used widely in many fields and proved of good effect. Some scholars point out that combine genetic algorithm and conventional heuristics often outperform either method operating alone. In this paper, we focus on encoding and individual searching to develop a hybrid genetic algorithm for the flowshop scheduling problem.
APA, Harvard, Vancouver, ISO, and other styles
10

Yang, Sheng-Fa, and 楊盛發. "Two-Machine No-wait Total Tardiness Flowshop Scheduling Problem." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/ugkp89.

Full text
Abstract:
碩士
朝陽科技大學
工業工程與管理系碩士班
94
Abstract The flowshop scheduling problem can be stated as follows. There are n independent jobs and m different machines. There is a common restriction on the order in which the operations of a job are to be performed. Each machine can process at most one job at a time and each job can be processed on one machine at a time. Flowshop scheduling is often encountered in mass production systems. Scheduling problems with no-wait constraints occur in many industries. For instance, in hot metal rolling industries , where the heated metal has to undergo a series of operations at continuously high temperatures before it is cooled in order to prevent defects. Similarly , in the plastic molding and silverware production industries, a series of operations must be performed to immediately follow one another to prevent degradation. We consider the performance measure of total tardinesss in a two-machine no-wait flow shop environment. In our research, we present a heuristic solution method for solving large-scaled problems. We also develop a branch and bound algorithm. We use an upper bound based on the heuristic algorithm developed, and propose some dominance rules to help pruning unpromising nodes in the branch-and-bound search tree. Finally, computational experiments are conducted to evaluate the performances of the proposed algorithms. As the result, branch-and-bound algorithm can only solve to the optimum solution small-scaled problems. When the number of jobs equals to 25, the average error of heuristic solution is 6%. The average error of lower bound is about 11%. The developed dominance rules help reducing 16%~20% nodes in the branch-and-bound search tree. Besides, our research examines two special cases of bottleneck-machine. It is showed that both heuristic solution and lower bound coincide with the optimum solution in great majority problems with bottleneck-machine. Therefore, problems with bottleneck-machine become easier to solve.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Permutacional Flowshop Scheduling Problem"

1

Nural, Ece, Ceren Sanisoğlu, Esennur Ermiş, Sinem Ünver, Zehra Gürçay, and Zehra Düzgit. "Hybrid Flowshop Scheduling Problem at DrPaste." In Lecture Notes in Mechanical Engineering, 693–707. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-62784-3_59.

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

Jukuntla, Amar. "Optimization Technique for Flowshop Scheduling Problem." In Advances in Intelligent Systems and Computing, 187–93. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-7868-2_18.

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

Jędrzejowicz, Joanna, and Piotr Jędrzejowicz. "New Upper Bounds for the Permutation Flowshop Scheduling Problem." In Innovations in Applied Artificial Intelligence, 232–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11504894_33.

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

Tonge, Vanita G., and Pravin Kulkarni. "Permutation Flowshop Scheduling Problem Using Classical NEH, ILS-ESP Operator." In Swarm, Evolutionary, and Memetic Computing, 595–605. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03756-1_53.

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

Aalvanger, G. H., N. H. Luong, P. A. N. Bosman, and D. Thierens. "Heuristics in Permutation GOMEA for Solving the Permutation Flowshop Scheduling Problem." In Parallel Problem Solving from Nature – PPSN XV, 146–57. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99253-2_12.

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

Yamada, Takeshi. "A Pruning Pattern List Approach to the Permutation Flowshop Scheduling Problem." In Operations Research/Computer Science Interfaces Series, 641–51. Boston, MA: Springer US, 2002. http://dx.doi.org/10.1007/978-1-4615-1507-4_29.

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

Taxidou, Andromachi, Ioannis Karafyllidis, Magdalene Marinaki, Yannis Marinakis, and Athanasios Migdalas. "A Hybrid Firefly - VNS Algorithm for the Permutation Flowshop Scheduling Problem." In Variable Neighborhood Search, 274–86. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-15843-9_21.

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

Mesgarpour, Mohammad, Nureddin Kirkavak, and Hakan Ozaktas. "Bicriteria Scheduling Problem on the Two-Machine Flowshop Using Simulated Annealing." In Evolutionary Computation in Combinatorial Optimization, 166–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12139-5_15.

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

Mousin, Lucien, Marie-Eléonore Kessaci, and Clarisse Dhaenens. "A New Constructive Heuristic for the No-Wait Flowshop Scheduling Problem." In Lecture Notes in Computer Science, 196–209. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-69404-7_14.

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

Erseven, Göksu, Gizem Akgün, Aslıhan Karakaş, Gözde Yarıkcan, Özgün Yücel, and Adalet Öner. "An Application of Permutation Flowshop Scheduling Problem in Quality Control Processes." In Proceedings of the International Symposium for Production Research 2018, 849–60. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-92267-6_68.

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

Conference papers on the topic "Permutacional Flowshop Scheduling Problem"

1

K, Gusti Ayu Dewi Puspa, and Komarudin. "Development of NEH for Permutation Flowshop Scheduling Problem." In APCORISE 2020: 3rd Asia Pacific Conference on Research in Industrial and Systems Engineering 2020. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3400934.3400985.

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

Qi, Tang, and Liu Peng. "Heuristic Different Algorithm for Chemical Parallel Flowshop Scheduling Problem." In 2014 7th International Symposium on Computational Intelligence and Design (ISCID). IEEE, 2014. http://dx.doi.org/10.1109/iscid.2014.252.

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

Khludova, M. "Evaluation model for the stochastic flowshop cyclic scheduling problem." In 2017 International Conference on Industrial Engineering, Applications and Manufacturing (ICIEAM). IEEE, 2017. http://dx.doi.org/10.1109/icieam.2017.8076385.

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

Sun, Heng, and Tsui-Ping Chung. "Two-stage hybrid flowshop scheduling problem with waiting time." In 2016 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, 2016. http://dx.doi.org/10.1109/ieem.2016.7797914.

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

Zelazny, Dominik, and Jaroslaw Pempera. "Solving multi-objective permutation flowshop scheduling problem using CUDA." In 2015 20th International Conference on Methods and Models in Automation and Robotics (MMAR ). IEEE, 2015. http://dx.doi.org/10.1109/mmar.2015.7283900.

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

Sasmito, Ayomi, and Asri Bekti Pratiwi. "Stochastic fractal search algorithm in permutation flowshop scheduling problem." In INTERNATIONAL CONFERENCE ON MATHEMATICS, COMPUTATIONAL SCIENCES AND STATISTICS 2020. AIP Publishing, 2021. http://dx.doi.org/10.1063/5.0042196.

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

Dugardin, Frederic, Lionel Amodeo, and Farouk Yalaoui. "FLC-archive to solve multiobjective reentrant hybride flowshop scheduling problem." In 2010 International Conference on Machine and Web Intelligence (ICMWI). IEEE, 2010. http://dx.doi.org/10.1109/icmwi.2010.5648191.

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

Bo Li, Changsheng Zhang, Ge Bai, and Erliang Zhang. "An improved particle swarm optimization algorithm for flowshop scheduling problem." In 2008 International Conference on Information and Automation (ICIA). IEEE, 2008. http://dx.doi.org/10.1109/icinfa.2008.4608187.

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

Yan, Ping, Ming-hai Jiao, and Li-qiang Zhao. "Scheduling a fuzzy flowshop problem to minimize weighted earliness-tardiness." In 2013 25th Chinese Control and Decision Conference (CCDC). IEEE, 2013. http://dx.doi.org/10.1109/ccdc.2013.6561407.

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

Qing Wang, Fan Wang, Shu-an Liu, and Yanhui Qi. "An optimization model for flexible routing based flowshop scheduling problem." In 2012 24th Chinese Control and Decision Conference (CCDC). IEEE, 2012. http://dx.doi.org/10.1109/ccdc.2012.6244320.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Permutacional Flowshop Scheduling Problem' for particular source types:
Journal articles Dissertations / Theses
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