Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Transfer Batch Scheduling for a Flexible Flowshop with Identical Parallel Machines at Each Stage

다단계 병렬 흐름생산시스템에서 이송크기가 2이상인 경우의 제품별 로트 투입순서 결정

  • ;
  • F. Fred Choobineh (Industria & Management Systems Engineering Department University of Nebraska Lincoln USA.)
  • Published : 2000.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

The problem of scheduling n independent jobs on serial stages with identical parallel machines at each stage is considered. Each job lot is allocated evenly to all machines at each stage for processing and moved in transfer batches between states., This scheduling strategy is called an identical production pattern. The objective is to find a permutation schedule that minimizes makespan. A branch and bound algorithm is suggested to find an optimal permutation schedule for a transformed problem A number examples is presented to illustrate the branch and bound algorithm, Computational results for 640 problems generated randomly show that within a resonable time the suggested algorithm can be used for transfer batch scheduling in a flexible flowshop.

Keywords

References

  1. Introduction to sequencing and scheduling Baker, K.R.
  2. Elements of Sequencing and Scheduling Baker, K.R.
  3. Annals of Operations Research v.57 Lot streaming in the two-machine flow shop with setup times Baker, K.R.
  4. Omega v.21 A comparative study of lot streaming procedures Baker, K.R.;D. Jia
  5. Decision Sciences v.21 Solution Procedures for the Lot-Streaming Problems Baker, K.R.;D.F. Pyke
  6. International Journal of Flexible Manufacturing Systems v.4 Scheduling tasks and vehicles in a flexible manufacturing systems Blazewicz, J.;H. Eiselt;G. Finke;G. Laporte;J. Weglarz
  7. Computer and Industrial Engineering v.22 Unit sized transfer batch scheduling with setup times Cetinkaya, F.C.;M.S. Kayaligil
  8. International Journal of Production Research v.34 Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time Guinet, A.G.P;M.M. Solomon
  9. International Journal of Production Research v.34 A computational study of heuristics for two-stage flexible flowshop Guinet, A.;M.M. Solomon;P.K. Kedia;A. Dussauchoy
  10. Naval Research Logistics Quarterly v.1 Optimal two-and three-stage production schedules with setup times included Johnson, S.M.
  11. A study on scheduling problems for flexible flow lines Kim, Joong-Soon
  12. Operations Research Letters v.8 Flowshop scheduling with lot streaming Potts, C.N.;K.R. Baker
  13. International Journal of Production Economics v.27 Scheduling in an n-job, m-stage flowshop with parallel processors to minimize makespan Rajendran, C.;D. Chaudhuri
  14. European Journal of Operational Research v.57 A multistage parallel processor flowshop problem with minimum flowtime Rajendran, C.;D. Chaudhuri
  15. European Journal of Operational Research v.24 Some no-wait shops scheduling problems: complexity concept Sriskandarajah, C.;P. Ladet
  16. European Journal of Operational Research v.43 Scheduling algorithms for flexible flowshops: worst and average case performance Sriskandarajah, C.;S.P. Sethi
  17. Operations Research v.41 Basic techniques for lot streaming Trietsch, D.;K. R. Baker
  18. International Journal of Production Research v.30 Two-and three-machine flow shop scheduling problems with equal sized transfer batches Vickson, R.G.;B.E. Alfredsson
  19. IBM Journal of Research and Development v.29 Scheduling algorithms for flexible flow lines Wittrock, R.J.
  20. Operations Research v.36 An adaptable scheduling algorithms for flexible flowlines Wittrock, R.J.
  21. Omega v.25 Transfer batch scheduling for a two-stage flowshop with identical parallel machines at each stage Kim, J-S;S-H Kang;SM Lee