Access the full text.
Sign up today, get DeepDyve free for 14 days.
J Jungwattanaki, M Reodecha, P Chaovalitwongse, F Werner (2005)
An evaluation of sequencing heuristics for flexible flow shop scheduling problems with unrelated parallel machines and dual criteria. Otto-von-Guericke-Universitat MagdeburgPreprint, 28
Oliver Holthaus (1999)
Scheduling in job shops with machine breakdowns: an experimental studyComputers & Industrial Engineering, 36
B. Norman, J. Bean (1999)
A GENETIC ALGORITHM METHODOLOGY FOR COMPLEX SCHEDULING PROBLEMSNaval Research Logistics, 46
A. Allahverdi (1995)
Two-Stage Production Scheduling with Separated Set-up Times and Stochastic BreakdownsJournal of the Operational Research Society, 46
N. Kasap, H. Aytug, Anand Paul (2006)
Minimizing makespan on a single machine subject to random breakdownsOper. Res. Lett., 34
M. Kurz, Ronald Askin (2003)
Comparing scheduling rules for flexible flow linesInternational Journal of Production Economics, 85
P. Stoop, V. Wiers (1996)
The complexity of scheduling in practiceInternational Journal of Operations & Production Management, 16
M. Zandieh, S. Ghomi, S. Husseini (2006)
An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup timesAppl. Math. Comput., 180
Chung-Yang Liu, Shi-Chung Chang (2000)
Scheduling flexible flow shops with sequence-dependent setup effectsIEEE Trans. Robotics Autom., 16
A. Allahverdi, J. Mittenthal (1998)
Dual criteria scheduling on a two-machine flowshop subject to random breakdownsInternational Transactions in Operational Research, 5
D. Pablo, A. Rodriguez-Gonzalez, J. Sicilia (2002)
An approach to solve the minimum expected makespan flow-shop problem subject to breakdownsEur. J. Oper. Res., 140
P. Luh, Ling Gou, Yuanhui Zhang, T. Nagahora, M. Tsuji, K. Yoneda, T. Hasegawa, Y. Kyoya, T. Kano (1995)
Job shop scheduling with group-dependent setups, finite buffers, and long time horizonAnnals of Operations Research, 76
Rubén Ruiz, T. Stützle (2008)
An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectivesEur. J. Oper. Res., 187
Rubén Ruiz, Concepción Maroto (2006)
A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibilityEur. J. Oper. Res., 169
PI Cowling, M Johansson (2002)
Using real-time information for effective dynamic schedulingEur J Oper Res, 139
J. Bean (1994)
Genetic Algorithms and Random Keys for Sequencing and OptimizationINFORMS J. Comput., 6
Chung-Yee Lee, Chen-Sin Lin (2001)
Single-machine scheduling with maintenance and repair rate-modifying activitiesEur. J. Oper. Res., 135
A. Allahverdi (1996)
Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum latenessComput. Oper. Res., 23
V. Suresh, D. Chaudhuri (1993)
Dynamic scheduling—a survey of researchInternational Journal of Production Economics, 32
Michael Pinedo (1994)
Scheduling: Theory, Algorithms, and Systems
I. Sabuncuoglu, M. Bayiz (2000)
Analysis of reactive scheduling problems in a job shop environmentEur. J. Oper. Res., 126
H. Allaoui, A. Artiba (2004)
Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraintsComput. Ind. Eng., 47
G. Vieira, J. Herrmann, E. Lin (2003)
Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and MethodsJournal of Scheduling, 6
P. Cowling, M. Johansson (2002)
Production, Manufacturing and Logistics Using real time information for effective dynamic scheduling
S. Pugazhendhi, S. Thiagarajan, C. Rajendran, N. Anantharaman (2004)
Generating non-permutation schedules in flowline-based manufacturing sytems with sequence-dependent setup times of jobs: a heuristic approachThe International Journal of Advanced Manufacturing Technology, 23
M. Kurz, Ronald Askin (2004)
Scheduling flexible flow lines with sequence-dependent setup timesEur. J. Oper. Res., 159
Teruhiko Yoshida, K. Hitomi (1979)
Optimal Two-Stage Production Scheduling with Setup Times SeparatedIie Transactions, 11
M. Yamamoto, S. Nof (1985)
Scheduling/rescheduling in the manufacturing operating system environment†International Journal of Production Research, 23
H. Allaoui, A. Artiba (2006)
Scheduling two-stage hybrid flow shop with availability constraintsComput. Oper. Res., 33
T Yoshida, K Hitomi (1979)
Optimal two-stage production scheduling with setup times separatedAIIE Trans, 11
TS Arthanary, KG Ramaswamy (1971)
An extension of two machine sequencing problemsOper Res, 8
C. Rajendran, Oliver Holthaus (1999)
A comparative study of dispatching rules in dynamic flowshops and jobshopsEur. J. Oper. Res., 116
Much of the research on operations scheduling problems has either ignored setup times or assumed that setup times on each machine are independent of the job sequence. Furthermore, most scheduling problems which have been discussed in the literature are under the assumption that machines are continuously available. Nevertheless, in most real life industries, a machine can be unavailable for many reasons, such as unanticipated breakdowns, i.e., stochastic unavailability, or due to a scheduled preventive maintenance where the periods of unavailability are known in advance, i.e., deterministic unavailability. This paper deals with the hybrid flow shop scheduling problems in which there are sequence-dependent setup times, commonly known as the SDST, and machines which suffer stochastic breakdown to optimize objectives based on expected makespan. This type of production system is found in industries such as chemical, textile, metallurgical, printed circuit board, and automobile manufacture. With the increase in manufacturing complexity, conventional scheduling techniques for generating a reasonable manufacturing schedule have become ineffective. The genetic algorithm can be used to tackle complex problems and produce a reasonable manufacturing schedule within an acceptable time. This paper describes how we can incorporate simulation into genetic algorithm approach to the scheduling of a SDST hybrid flow shop with machines that suffer stochastic breakdown. An overview of the hybrid flow shops and scheduling under stochastic unavailability of machines are presented. Subsequently, the details of incorporated simulation into genetic algorithm approach are described and implemented. Consequently, the results obtained are analyzed with Taguchi experimental design.
The International Journal of Advanced Manufacturing Technology – Springer Journals
Published: Jun 12, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.