Browse > Article

Scheduling Methods for a Hybrid Flowshopwith Dynamic Order Arrival  

Lee, Geun-Cheol (College of Business Administration, Konkuk University)
Publication Information
Journal of Korean Institute of Industrial Engineers / v.32, no.4, 2006 , pp. 373-381 More about this Journal
Abstract
This paper considers a scheduling problem for a hybrid flowshop with dynamic order arrival. A hybrid flowshop is an extended form of a flowshop, which has serial stages like a flowshop but there can be more than one machine at each stage. In this paper, we propose a new method for the problem of scheduling with the objective of minimizing mean tardiness of orders which arrive at the shop dynamically. The proposed method is based on the list scheduling approach, however we use a more sophisticated method to prioritize lots unlike dispatching rule-based methods. To evaluate the performance of the proposed method, a simulation model of a hybrid flowshop-type production system is constructed. We implement well-known dispatching rules and the proposed methods in the simulation model. From a series of simulation tests, we show that the proposed methods perform better than other methods.
Keywords
Scheduling; Hybrid Flowshop; Simulation;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Nawaz, M., Enscore, E., and Ham, I. (1983), A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA, The International Journal of Management Science, 11, 91-95
2 Bengu, G. (1994), A simulation-based scheduler for flexible flowlines. International Journal of Production Research, 32, 321-344   DOI   ScienceOn
3 Cheng, J., Karuno, Y., and Kise, H. (2001), A shifting bottleneck approach for a parallel machine flowshop scheduling problem. Journal of the Operations Research Society of Japan, 44, 140-156   DOI
4 Choi, S-W., Kim, Y-D., and Lee, G-C. (2005), Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop. International Journal of Production Research, 43, 2049-2067   DOI   ScienceOn
5 Guinet, A. G. P. and Solomon, M. M. (1996), Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time. International Journal of Production Research, 34,1643-1654   DOI   ScienceOn
6 Huang, W. and Li, W. (1998), A two-stage hybrid flowshop with uniform machines and setup times. Mathematical and Computer Modelling, 27, 27-45
7 Jin, Z. H., Ohno, K., Ito, T., Elmaghraby, S. E. (2002), Scheduling hybrid flowshops in printed circuit board assembly lines. Production and Operations Management, 11, 16-230
8 Kochhar, S. and Morris, R. J. T. (1987), Heuristic methods for flexible flow line scheduling, Journal of Manufacturing Systems, 6, 299-314   DOI   ScienceOn
9 Quadt, D. (2004), Lot-sizing and scheduling for flexible flow lines, Lecture notes in economics and mathematical systems, Springer, Berlin Germany
10 Alisantoso, D., Khoo, L. P., and Jiang, P. Y. (2003), An immune algorithm approach to the scheduling of a flexible PCB flow shop. International Journal of Advanced Manufacturing Technology, 22, 819-827   DOI   ScienceOn
11 Brah, S. A. and Loo, L. L. (1999), Heuristics for scheduling in a flow shop with multiple processors. European Journal of Operational Research, 113, 113-122   DOI   ScienceOn
12 Gupta, J. N. D., Hariri, A. M. A., and Potts, C. N. (1997), Scheduling a two-stage flow shop with parallel machines at the first stage. Annals of Operations Research, 69, 171-191   DOI
13 Wang, H. (2005), Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions, Expert Systems, 22, 78-85   DOI   ScienceOn
14 Kurz, M. E. and Askin, R. G. (2003), Comparing scheduling rules for flexible flow lines. International Journal of Production Economics, 85, 371-388   DOI   ScienceOn
15 Lee, G-C., Kim, Y-D., Kim, J-G., and Choi, S-H. (2003), A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system. Journal of the Operational Research Society, 54,1038-1049   DOI   ScienceOn
16 Azizoglu, M., Cakmak, E. and Kondakci, S. (2001), A flexible flowshop problem with total flow time minimization. European Journal of Operational Research, 132, 528-538   DOI   ScienceOn
17 Moursli, O. and Pochet, Y. (2000), A branch-and-bound algorithm for the hybrid flowshop. International Journal of Production Economics, 64, 113-125   DOI
18 Kis, T. and Pesch, E. (2005), A review of exact solution methods for the on-preemptive multiprocessor flowshop problem. European Journal of Operational Research, 164, 592-608   DOI   ScienceOn
19 Lee, Y. H. and Pinedo, M. (1997), Scheduling jobs on parallel machines with sequence-dependent setup times. European Journal of Operational Research, 100, 464-474   DOI   ScienceOn
20 Lee, G-C., Kim, Y-D., and Choi, S-W. (2004), Bottleneck-focused scheduling for a hybrid flowshop. International Journal of Production Research, 42, 165-181   DOI   ScienceOn
21 Brah, S. A. (1996), A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors. Production Planning and Control, 7, 362-373