Filters








69 Hits in 4.7 sec

Flowshop-scheduling problems with makespan criterion: a review

S. Reza Hejazi *, S. Saghafian
2005 International Journal of Production Research  
It mainly considers a flowshop problem with a makespan criterion and it surveys some exact methods (for small size problems), constructive heuristics and developed improving metaheuristic and evolutionary  ...  Each part has a brief literature review of the contributions and a glimpse of that approach before discussing the implementation for a flowshop problem.  ...  They developed heuristic algorithms by the introduction of simplifying assumptions into the scheduling problem under study.  ... 
doi:10.1080/0020754050056417 fatcat:gbcqshoqerhnjek2l4uqcmhdr4

An extensive and systematic literature review for hybrid flowshop scheduling problems

Murat Çolak, Gülşen Aydın Keskin
2022 International Journal of Industrial Engineering Computations  
Hybrid flowshop scheduling problem (HFSP) is a mixture of two classical scheduling problems as parallel machine scheduling (PMS) and flowshop scheduling (FS).  ...  Therefore, it will be useful to present a review study including recent papers and developments related to this problem for researchers.  ...  Hybrid flowshop scheduling problem (HFSP) is a combination of parallel machine and flowshop scheduling environments and there are k stages that at least one of these stages has parallel machines (identical  ... 
doi:10.5267/j.ijiec.2021.12.001 fatcat:hfmfq3h73femphrdw4wgpedsfq

Intelligent Decision-Making of Scheduling for Dynamic Permutation Flowshop via Deep Reinforcement Learning

Shengluo Yang, Zhigang Xu, Junyi Wang
2021 Sensors  
To realize real-time and the intelligent decision-making of dynamic scheduling, we studied dynamic permutation flowshop scheduling problem (PFSP) with new job arrival using deep reinforcement learning  ...  A system architecture for solving dynamic PFSP using DRL is proposed, and the mathematical model to minimize total tardiness cost is established.  ...  To solve the NP-hard problem, many hybrid meta-heuristics have been proposed [2, 3] .  ... 
doi:10.3390/s21031019 pmid:33540868 fatcat:upevnkbxf5hp5kuhn7nbtgajaq

INVERSE SCHEDULING IN FLOWSHOP WITH MULTIPLE MACHINES

Shrivatsa P. Aparanji, M. Srinivasa Rao, V.V.S. Kesavarao
2019 INTERNATIONAL JOURNAL OF PRODUCTION TECHNOLOGY AND MANAGEMENT  
Meta heuristics are applied to solve the problem six instances are adopted to verify the effectiveness of the proposed algorithm.  ...  Traditional schedule will not address all these issues. In this paper, the inverse scheduling for multi machine flow shop with make span as objective is illustrated.  ...  CONCLUSIONS In this paper, multi -machine inverse scheduling problem with make span time minimization is explored and suggested a heuristic to solve Firstly, a mathematical model is constructed and a genetic  ... 
doi:10.34218/ijptm.10.1.2019.003 fatcat:llxyltthxne3zmfe5t7kgbz4p4

The Impact of Local Search Strategies on Chaotic Hybrid Firefly Particle Swarm Optimization Algorithm in Flow-Shop Scheduling

Abdülkadir Gümüşçü, Serkan Kaya, Mehmet Emin Tenekeci, İzzettin Hakan Karaçizmeli, İbrahim Berkan Aydilek
2021 Journal of King Saud University: Computer and Information Sciences  
Therefore, scheduling remains an important area of study for researchers.  ...  These findings can be a point of reference for future research.  ...  Being one of the leading problems, flowshop scheduling is commonly seen in industry [4] . Given the size of these problems, it is clear that a meta-heuristic method should be used.  ... 
doi:10.1016/j.jksuci.2021.07.017 fatcat:kootvwmpkfcrnfq5lyaqitpuw4

A new hybrid ant colony algorithm for scheduling of no-wait flowshop

Vahid Riahi, Morteza Kazemi
2016 Operational Research  
The no-wait flowshop is a variant of the wellknown flowshop scheduling problem where all processes follow the previous one without any interruption for operations of a job.  ...  Owing to the problem is known to be NP-hard for more than two machines, a hybrid meta-heuristic algorithm based on ant colony optimization (ACO) and simulated annealing (SA) algorithm is improved.  ...  This inspired us to develop a new ACO to solve no-wait flowshop problem. Flowshop scheduling problem can be regarded as a hard optimization problem.  ... 
doi:10.1007/s12351-016-0253-x fatcat:f3rvp6hkojb3pcp3ysxhxrbuu4

Metaheuristics for Solving a Hybrid Flexible Flowshop Problem with Sequence-Dependent Setup Times [chapter]

Aymen Sioud, Caroline Gagné, Marc Gravel
2014 Lecture Notes in Computer Science  
In this paper, we propose three new metaheuristic implementations to address the problem of minimizing the makespan in a hybrid flexible flowshop with sequence-dependent setup times.  ...  The third metaheuristic is a hybridization (HGA) of the GA and the ACO algorithms.  ...  But explicit setup times must be included in scheduling decisions in order to model a more realistic variant of hybrid flowshop scheduling problems.  ... 
doi:10.1007/978-3-319-12970-9_2 fatcat:th2brxjhi5gq3kledxznzycene

A survey of scheduling problems with setup times or costs

Ali Allahverdi, C.T. Ng, T.C.E. Cheng, Mikhail Y. Kovalyov
2008 European Journal of Operational Research  
Allahverdi and Al-Anzi (2002) showed that the MDO scheduling problem for WWW applications can be modeled as a two-machine flow shop scheduling problem with separate setup times. • Kim et al. (2002) considered  ...  algorithm.  ...  Leu and Wang (2000) studied the same problem in a hybrid order shipment environment.  ... 
doi:10.1016/j.ejor.2006.06.060 fatcat:gaq5slhjsjfybjpx54qcveslme

An improved sheep flock heredity algorithm for job shop scheduling and flow shop scheduling problems

Chandramouli Anandaraman
2011 International Journal of Industrial Engineering Computations  
Job Shop Scheduling Problem (JSSP) and Flow Shop Scheduling Problem (FSSP) are strong NP-complete combinatorial optimization problems among class of typical production scheduling problems.  ...  An improved Sheep Flock Heredity Algorithm (ISFHA) is proposed in this paper to find a schedule of operations that can minimize makespan.  ...  This algorithm can also be applied to optimize multi machine environment and the dynamic JSSP.  ... 
doi:10.5267/j.ijiec.2011.06.007 fatcat:lgubpvyvwzfnbcjostdrp7hxg4

Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers

Victor Yaurima, Larisa Burtseva, Andrei Tchernykh
2009 Computers & industrial engineering  
This paper presents a genetic algorithm for an important production scheduling problem.  ...  Since the problem is NP-hard, we focus on suboptimal scheduling solutions for the hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints, and limited buffers.  ...  This work is partly supported by CONACYT (Consejo Nacional de Ciencia y Tecnología de México) under Grant No. 48385, UABC (Autonomous University of Baja California, Mexico) under Grant No. 2389, and PROMEP  ... 
doi:10.1016/j.cie.2008.09.004 fatcat:coqjvwln4ja23oumxhh5pminp4

Hybrid stage shop scheduling

Andrea Rossi, Sauro Soldani, Michele Lanzetta
2015 Expert systems with applications  
Bensmaine, Dahane, and Benyoucef (2013) proposed a new heuristics to integrate the process planning and scheduling problem for reconfigurable machine tools, each with multiple configurations, and can perform  ...  The HSSS formally extends mixed shop scheduling (a combination of flowshop and open shop), which is able to model routing flexibility, and hybrid shop scheduling, which provides resource flexibility.  ...  Acknowledgements The authors would like to thank the management of the anonymous high-fashion company from a reputed international group for providing the information about their manufacturing process.  ... 
doi:10.1016/j.eswa.2014.12.050 fatcat:njv23orz65ce7dj5dqidj5w4oq

Genetic Algorithms for Solving Scheduling Problems in Manufacturing Systems

Anna Ławrynowicz
2011 Foundations of Management  
It is a very effective algorithm to search for optimal or near-optimal solutions for an optimization problem.  ...  This paper contains a survey of recent developments in building genetic algorithms for the advanced scheduling.  ...  For the job shop scheduling problem, a hybrid evolutionary algorithm was also presented in work of Zobolas et al. [64] .  ... 
doi:10.2478/v10238-012-0039-2 fatcat:s47tk2aqtved3l4hoau5wkq6hu

Tabu Search: A Comparative Study [chapter]

Harun Pirim, Engin Bayraktar, Burak Eksioglu
2008 Tabu Search  
Pan et al. (2008) proposed a PSO algorithm for a no-wait flowshop scheduling problem.  ...  Eksioglu et.al. (2008) also used a TS algorithm utilizing changing neighborhoods for a flowshop scheduling problem.  ...  The goal of this book is to report original researches on algorithms and applications of Tabu Search to realworld problems as well as recent improvements and extensions on its concepts and algorithms.  ... 
doi:10.5772/5637 fatcat:taxjflzhebherlapwehn6d6ci4

A hybrid electromagnetism-like algorithm for single machine scheduling problem

Pei-Chann Chang, Shih-Hsin Chen, Chin-Yuan Fan
2009 Expert systems with applications  
In this paper, we present a new meta-heuristic that applies the EM methodology to the single machine scheduling problem.  ...  This research attempts to employ the random-key concept combining with genetic operators in the hybrid algorithm to obtain the best/optimal schedule for the single machine problems.  ...  Wang gave us some suggestions for this paper.  ... 
doi:10.1016/j.eswa.2007.11.050 fatcat:cwgahnxwnrevblk3e5se6yl66a

An Improved Genetic Algorithm for Single-Machine Inverse Scheduling Problem

Jianhui Mou, Xinyu Li, Liang Gao, Chao Lu, Guohui Zhang
2014 Mathematical Problems in Engineering  
In this paper, the inverse scheduling with weighted completion time (SMISP) is considered in a single-machine shop environment.  ...  Traditional scheduling strategies, however, cannot cope with these cases. Therefore, a new idea of scheduling called inverse scheduling has been proposed.  ...  Acknowledgments This research work was supported by the National Science Foundation of China (NSFC) under Grant nos. 51375004 and 51121002, Independent Innovation Finance HUST Support Plan under Grant  ... 
doi:10.1155/2014/370560 fatcat:sisphi74r5dkhpwch2toslkble
« Previous Showing results 1 — 15 out of 69 results