Abstract
In this paper, we consider two-machine permutation flow shop scheduling problem to minimize the makespan in which some of the jobs have to be processed with no-wait in process. We also consider precedence constraints which impose some jobs to be processed before or after some others. We propose a constructive algorithm to find a feasible solution. We also develop a Tabu Search algorithm to solve this problem. Our computational analysis indicates its good performance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
P.C. Gilmore, R.E. Gomory, Sequencing a one-state variable machine: a solvable case of the traveling salesman problem, Oper. Res. 12 (1964) 655679
P.C. Gilmore, E.L. Lawler, D.B. Shmoys, Well solved special cases, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.), The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization, Wiley, Chichester, 1985, pp. 87143
S.M. Johnson, Optimal two-and three-stage production schedules with setup times included, Naval Res. Logist. Quart. 1 (1954) 6168
J.-L. Bouquard, J.-C. Billaut, M.A. Kubzin, V.A. Strusevich, Two-machine flowshop scheduling problems with no-wait jobs, Operations Research Letters 33 (2005) 255–262
Jozef Grabowski, Jaroslaw Pempera, Some local search algorithms for no-wait & flow-shop problem with makespan criterion, Computers & Operations Research 32 (2005) 21972212
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Samie, S., Karimi, B. (2007). Two-Machine No-Wait Flow Shop Scheduling Problem with Precedence Constraints. In: Waldmann, KH., Stocker, U.M. (eds) Operations Research Proceedings 2006. Operations Research Proceedings, vol 2006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69995-8_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-69995-8_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69994-1
Online ISBN: 978-3-540-69995-8
eBook Packages: Business and EconomicsBusiness and Management (R0)