Advertisement

Sequencing and Scheduling for Non-Serial Permutation Flowshops

  • Robert Burdett
  • Erhan Kozan
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 43)

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.

Keywords

Sequencing scheduling flowshop mixed-model assembly 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal A., Harkalakis G., Minis I. and Nagi R. Just-in-time production of large assemblies. IIE Transactions 1996; 28: 653-667Google Scholar
  2. 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–1470CrossRefGoogle Scholar
  3. 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–48CrossRefGoogle Scholar
  4. 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–498CrossRefGoogle Scholar
  5. Bolat A. Stochastic procedures for scheduling minimum job sets on mixed model assembly lines. Journal of the Operational Research Society 1997; 48(5): 490–501Google Scholar
  6. Burdett R. L. and Kozan E. Sequencing and scheduling within a mixed flowshop environment. Under review Mathematical and Computer Modelling 2000Google Scholar
  7. 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)Google Scholar
  8. Dauzere-Peres S., Roux W. and Lasserre J. B. Multi-resource shop scheduling with resource flexibility. European Journal of Operations Research 1998; 107: 289–305CrossRefGoogle Scholar
  9. 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–50CrossRefGoogle Scholar
  10. 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–26Google Scholar
  11. 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–213CrossRefGoogle Scholar
  12. 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.CrossRefGoogle Scholar
  13. Koulamas C. A new constructive heuristic for the flowshop scheduling problem. European Journal of Operational Research 1998; 105: 66–71CrossRefGoogle Scholar
  14. 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–77Google Scholar
  15. 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–968CrossRefGoogle Scholar
  16. 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–95CrossRefGoogle Scholar
  17. 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–253CrossRefGoogle Scholar
  18. Osman I. H. and Potts C. N. Simulated Annealing for permutation flow-shop scheduling. Omega 1989: 17; 551–557CrossRefGoogle Scholar
  19. 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–407CrossRefGoogle Scholar
  20. 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.CrossRefGoogle Scholar
  21. Reeves C. A genetic algorithm for flowshop sequencing. Computers and Operations Research 1995; 22: 5–13CrossRefGoogle Scholar
  22. 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–1060CrossRefGoogle Scholar
  23. 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–390CrossRefGoogle Scholar
  24. Taillard E. Some efficient heuristic methods for the flowshop sequencing problem. European Journal of Operations Research 1990; 47: 65–74CrossRefGoogle Scholar
  25. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 1993; 64: 278–285CrossRefGoogle Scholar
  26. Widmer M. and Hertz A. A new heuristic method for the flow shop sequencing problem. European Journal of Operations Research 1989; 41: 186–193CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Robert Burdett
    • 1
  • Erhan Kozan
    • 1
  1. 1.School of Mathematical SciencesQueensland University of TechnologyBrisbaneAustralia

Personalised recommendations