Abstract
Most flowshop problems that have been researched have dealt with serial precedence requirements such that the flowshop has become synonymous with the serial assembly line. However, non-serial precedence requirements can also occur for which the resulting problem is still a type of flowshop. This research addresses in particular, non-serial versions of the three standard flowshop problems, namely the intermediate storage, no-intermediate storage and no-wait flowshop scenarios. The outcomes of this research include a number of new and alternative mathematical formulations for finding the optimal sequence of the products to be processed through the non-serial line. Secondly recurrence equations for scheduling purposes have also been developed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal A., Harkalakis G., Minis I. and Nagi R. Just-in-time production of large assemblies. IIE Transactions 1996; 28: 653-667
Anwar M. F. and Nagi R. Integrated lot-sizing and scheduling for just-in-time production of complex assemblies with finite set-ups. International Journal of Production Research 1997 35(5): 1447–1470
Bard J. F., Dar-El E. and Shtub A. An analytic framework for sequencing mixed model assembly lines. International Journal of Production Research 1992; 30(1): 35–48
Bolat A., Savsar M. and Al-Fawzan M. A. Algorithms for real-time scheduling of jobs on mixed model assembly lines. Computers and Operations Research 1994; 21(5): 487–498
Bolat A. Stochastic procedures for scheduling minimum job sets on mixed model assembly lines. Journal of the Operational Research Society 1997; 48(5): 490–501
Burdett R. L. and Kozan E. Sequencing and scheduling within a mixed flowshop environment. Under review Mathematical and Computer Modelling 2000
Cambell H.G., Dudek R. A. and Smith M. L. A heuristic algorithm for the n job, m machine sequencing problem. Management Science 1970; 16(16)
Dauzere-Peres S., Roux W. and Lasserre J. B. Multi-resource shop scheduling with resource flexibility. European Journal of Operations Research 1998; 107: 289–305
Ding F. Y. and Cheng L. A simple sequencing algorithm for mixed model assembly lines in just-in-time production systems. Journal of Operations Management 1993; 11: 43–50
Duplaga E. A., Hahn C. K. and Hur D. Mixed-model assembly line sequencing at Hyundai Motor Company. Production and Inventory Management Journal 1996; 37: 20–26
Groeflin H, Luss H., Rosenwein M. B. and Wahls E. T. Final assembly sequencing for just-in-time manufacturing. International Journal of Production Research 1989; 27(2): 199–213
Kim J. U. and Kim Y. D. Simulated annealing and genetic algorithms for scheduling products with multi-level product structure. Computers and Operations Research 1996; 23(9): 857–868.
Koulamas C. A new constructive heuristic for the flowshop scheduling problem. European Journal of Operational Research 1998; 105: 66–71
Laisare P and Sen S. Evaluating backward scheduling and sequencing rules for an assembly shop environment. Production and Inventory Management Journal 1995; 36(4): 71–77
Murata T., Ishibuchi H. and Tanaka H. Multi-objective genetic algorithm and its applications to flowshop scheduling. Computers and industrial Engineering 1996; 30(4): 957–968
Nawaz M., Enscore E. E. and Ham I. A heuristic algorithm for the m-machine n-job flow shop sequencing problem. Omega 1983; 11(1): 91–95
Ogbu F. A. and Smith D. K. The application of the simulated annealing algorithm to the solution of the N/M/Cmax flowshop problem. Computers and Operations Research 1990; 17(3): 243–253
Osman I. H. and Potts C. N. Simulated Annealing for permutation flow-shop scheduling. Omega 1989: 17; 551–557
Ozdamar L. and Ulusoy G. A note on an iterative forward/backward scheduling technique with reference to a procedure by Li and Wills. European Journal of Operations Research 1996; 89(2): 400–407
Patterson J. H., Talbot B. F., Slowinski R. and Weglarz J. Computational experience with a backtracking algorithm for solving a general class of precedence and resource constrained scheduling problems. European Journal of Operations Research 1990; 49: 68–79.
Reeves C. A genetic algorithm for flowshop sequencing. Computers and Operations Research 1995; 22: 5–13
Roach A. and Nagi R. A hybrid GA-SA algorithm for just-in-time scheduling of multi-level assemblies. Computers and Industrial Engineering 1996; 30(4): 1047–1060
Sumichrast R. T. and Russell R. S. Evaluating mixed model assembly line sequencing heuristics for just-in-time production systems. Journal of Operations Management 1990; 3: 371–390
Taillard E. Some efficient heuristic methods for the flowshop sequencing problem. European Journal of Operations Research 1990; 47: 65–74
Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 1993; 64: 278–285
Widmer M. and Hertz A. A new heuristic method for the flow shop sequencing problem. European Journal of Operations Research 1989; 41: 186–193
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Burdett, R., Kozan, E. (2002). Sequencing and Scheduling for Non-Serial Permutation Flowshops. In: Kozan, E., Ohuchi, A. (eds) Operations Research/Management Science at Work. International Series in Operations Research & Management Science, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0819-9_2
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0819-9_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5254-9
Online ISBN: 978-1-4615-0819-9
eBook Packages: Springer Book Archive