Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines

International Journal of Production Research

Volumn 46, Issue 22, 2008, Pages 6415-6430

  Chen, Chun Lung ^a   Chen, Chuen Lung ^a  

^a NATIONAL CHENGCHI UNIVERSITY   (Taiwan)

Author keywords

Bottleneck based heuristics; Flexible flow line; Unrelated parallel machines

Indexed keywords

HEURISTIC METHODS; RIVERS;

ARRIVAL TIMES; BOTTLENECK-BASED HEURISTICS; COMPUTATIONAL RESULTS; DECISION RULES; DISPATCHING RULES; EXPERIMENTAL FACTORS; FLEXIBLE FLOW; FLEXIBLE FLOW LINE; FLOW LINES; MACHINE SELECTION; NEW APPROACHES; NUMBER OF TARDY JOBS; SCHEDULING JOBS; TARDY JOBS; TEST PROBLEMS; UNRELATED PARALLEL MACHINES;

STAGES;

EID: 53349129893     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540701352102     Document Type: Article

References (28)

1. Adler, L., Fraiman, N., Kobacker, E., Pinedo, M., Plotnicoff, J.C. and Wu, T.P., BPSS: A scheduling support system for the packaging industry. Operat. Res., 1993, 41, 641-648.
2. Alisantoso, D., Khoo, L.P. and Jiang, P.Y., An immune algorithm approach to the scheduling of a flexible PCB flow shop. Int. J. Adv. Manufact. Technol., 2003, 22, 819-827.
3. Azizoglu, M., Cakmak, E. and Kondakci, S., A flexible flowshop problem with total flow time minimization. Eur. J. Operat. Res., 2001, 132, 528-538.
4. Bertel, S. and Billaut, J.C., A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. Eur. J. Oper. Res., 2004, 159, 651-662.
5. Brah, S.A., A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors. Product. Plan. Control, 1996, 7, 362-373.
6. Chen, Y.C. and Lee, C.E., Bottleneck-based group scheduling in a flow line cell. Int. J. Indust. Eng. Applic. Pract., 1998, 5, 288-300.
7. Choi, S.W., Kim, Y.D. and Lee, G.C., Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop. Int. J. Product. Res., 2005, 43, 2149-2167.
8. Conway, R., Comments on an exposition of multiple constraint scheduling. Product. Operat. Manage., 1997, 6, 23-24.
9. Goldratt, E. and Cox, J., The Goal: A Process of Ongoing Improvement, 1992 (North River Press: New York).
10. Goldratt, E. and Fox, R., The Race, 1986 (North River Press: New York).
11. Hsieh, J.C, Chang, P.C. and Hsu, L.C., Scheduling of drilling operations in printed circuit board factory. Comput. Indust. Eng., 2003, 44, 461-473.
12. Hunsucker, J.L. and Shah, J.R., Performance of priority rules in a due date flow shop. Omega, 1992, 20, 73-89.
13. Jayamohan, M.S. and Rajendran, C., A comparative analysis of two different approaches to scheduling in flexibile flow shops. Product. Plan. Control, 2000, 11, 216-230.
14. Jin, Z.H., Ohno, K., Ito, T. and Elmaghraby, S.E., Scheduling hybrid flowshops in printed circuit board assembly lines. Product. Operat. Manage., 2002, 11, 216-230.
15. Kadipasaoglu, S.N., Xiang, W. and Khumawala, B.M., A comparison of sequencing rules in static and dynamic hybrid flow systems. Int. J. Product. Res., 1997, 35, 1359-1384.
16. Kim, D.W., Na, D.G. and Chen, F.F., Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective. Robot. Comput. Integ. Manufact., 2003, 19, 173-181.
17. Lee, G.C., Kim, Y.D. and Choi, S.W., Bottleneck-focused scheduling for a hybrid flowshop. Int. J. Product. Res., 2004, 42, 165-181.
18. Lee, G.C., Kim, Y.D., Kim, J.G. and Choi, S.H., A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system. J. Operat. Res. Soc., 2003, 54, 1038-1049.
19. Lenstra, J.K., Rinnooy Kan, A.H.G. and Brucker, P., Complexity of machine scheduling problems. Ann. Discr. Math., 1977, 1, 343-362.
20. Linn, R. and Zhang, W., Hybrid flow shop scheduling: a survey. Comput. Indust. Eng., 1999, 37, 57-61.
21. Low, C.Y., Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Comput. Operat. Res., 2005, 32, 2013-2025.
22. Moore, J.M., Sequencing n jobs on one machine to minimize the number of tardy jobs. Manage. Sci., 1968, 15, 102-109.
23. Pinedo, M., Scheduling: Theory, Algorithms, and Systems, 2002 (Prentice-Hall: Upper Saddle River, : NJ).
24. Ruiz, R. and Maroto, C., A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. Eur. J. Operat. Res., 2006, 169, 781-800.
25. Santos, D.L., Hunsucker, J.L. and Deal, D.E., Global lower bound for flow shops with multiple processors. Eur. J. Operat. Res., 1995, 80, 112-120.
26. Sawik, T., An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. Math. Comput. Model., 2002, 36, 461-471.
27. Yang, T., Kuo, Y. and Chang, I., Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors - a case study. Int. J. Product. Res., 2004, 42, 4015-4030.
28. Yu, L., Shih, H.M., Pfund, M., Carlyle, W.M. and Fowler, J.W., Scheduling of unrelated parallel machines: an application to PWB manufacturing. HE Trans., 2002, 34, 921-931.