Scheduling hybrid flowshops in printed circuit board assembly lines

Production and Operations Management

Volumn 11, Issue 2, 2002, Pages 216-230

  Jin, Z H ^a,b,c,d   Ohno, K ^b,e,f,g,h   Ito, T ^b,i   Elmaghraby, S E ^j,k,l  

^a NORTHEASTERN UNIVERSITY   (United States)

^b NAGOYA INSTITUTE OF TECHNOLOGY   (Japan)

^c NORTHEASTERN UNIVERSITY   (China)

^d Japan Indust Management Association   (Japan)

^e KYOTO UNIVERSITY   (Japan)

^f TOYOTA MOTOR CORPORATION   (Japan)

^g OSAKA UNIVERSITY   (Japan)

^h KONAN UNIVERSITY   (Japan)

ⁱ RITSUMEIKAN UNIVERSITY   (Japan)

^j NORTH CAROLINA STATE UNIVERSITY   (United States)

^k UNIVERSITÉ LYON 1   (France)

^l Institute of Industrial Engineering

more..

Author keywords

Heuristics; Hybrid flowshops; Printed circuit board assembly; Scheduling

Indexed keywords

EID: 10444255675     PISSN: 10591478     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.1937-5956.2002.tb00492.x     Document Type: Article

References (30)

1. ARTHANARY, T. S. AND K. G. RAMASWAMY (1971), "An Extension of Two Machine Sequencing Problem," Opsearch, 8, 1, 10-22.
2. BEN-ARIEH, D. AND O. MAIMON (1992), "Annealing Method for PCB Assembly Scheduling on Two Sequential Machines," International Journal of Computer Integrated Manufacturing, 5, 6, 361-367.
3. CARLIER, J. (1987), "Scheduling Jobs with Release Dates and Tails on Identical Machines to Minimize the Makespan," European Journal of Operational Research, 29, 3, 298-306.
4. CHEN, B., C. A. GLASS, C. N. POTTS, AND V. A. STRUSEVICH (1996), "A New Heuristic for Three-Machine Flowshop Scheduling," Operations Research, 44, 6, 891-898.
5. DEAL, D. E. AND J. L. HUNSUCKER (1991), "The Two-Stage Flowshop Scheduling Problem with m Machines at Each Stage," Journal of the Information and Optimization Sciences, 12, 3, 407-417.
6. FEO, T. A., J. F. BARD, AND S. D. HOLLAND (1996), "A GRASP for Scheduling Printed Wiring Board Assembly," IIE Transactions, 28, 2, 155-165.
7. GOLDBERG, D. E. (1989), Genetic Algorithm in Search, Optimization, and Machine Learning, Addison-Wesley, Menlo Park, CA.
8. GUINET, A., M. M. SOLOMON, P. K. KEDIA, AND A. DUSSAUCHOY (1996), "A Computational Study of Heuristics for Two-Stage Flexible Flowshop," International Journal of Production Research, 34, 5, 1399-1415.
9. GUPTA, J. N. D., A. M. A. HARIRI, AND C. N. POTTS (1997), "Scheduling a Two-Stage Hybrid Flow Shop with Parallel Machines at the First Stage," Annals of Operations Research, 69, 171-191.
10. _ AND E. A. TUNC (1991), "Schedules for a Two-Stage Hybrid Flowshop with Parallel Machine at the Second Stage," International Journal of Production Research, 29, 7, 1489-1502.
11. HAOUARI, H. AND R. M'HALLAH (1997), "Heuristic Algorithms for the Two-Stage Hybrid Flowshop Problem," Operations Research Letters, 21, 1, 43-53.
12. JACKSON, J. R. (1955), Scheduling a Production Line to Minimize Maximum Tardiness, Research No. 43, Management Science Research Project, University of California, Los Angeles, CA.
13. JOHNSON, S. M. (1954), "Optimal Two- and Three-Stage Production Schedules with Setup Times Included," Naval Research Logistics Quarterly, 1, 1, 61-68.
14. LANGSTON, M. A. (1987), "Interstage Transportation Planning in the Deterministic Flow-Shop Environment," Operations Research, 35, 4, 556-564.
15. LAWLER, E. L., K. L. JAN, H. G. R. K. ALEXANDER, AND B. S. DAVID (1993), "Sequencing and Scheduling: Algorithms and Complexity," in Handbooks in Operations Research and Management Science, Logistics of Production and Inventory, S. C. Graves, A. H. G. Rinnooy Kan, and P. H. Zipkin (eds.), North Holland, Amsterdam, New York, 4, 445-522.
16. LEE, C.-Y. AND G. VAIRAKTARAKIS (1994), "Minimizing Makespan in Hybrid Flowshops," Operations Research Letters, 16, 3, 149-158.
17. MICHALEWICZ, Z. (1994), Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, Berlin.
18. MICHEL, G., G. NATHALIE, AND N. SYLVIE (1999), "Metaheuristics for the Deterministic Hybrid Flowshop Problem" in Proceedings Book 1 of IEPM'99 International Conference on Industrial Engineering and Production Management, 136-145.
19. NAWAZ, M., E. E. ENSCORE, JR., AND I. HAM (1983), "A Heuristic Algorithm for the m-Machine, n-Job Flow-Shop Sequencing Problem," OMEGA The International Journal of Management Science, 11, 1, 91-95.
20. NOWICKI, E. AND C. SMUTNICKI (1998), "The Flow Shop with Parallel Machines: A Tabu Search Approach," European Journal of Operational Research, 106, 2, 226-253.
21. OLIVER, I. M., D. J. SMITH, AND J. R. C. HOLLAND (1987), "A Study of Permutation Crossover Operators on the Traveling Salesman Problem," Proceedings of 2nd International Conference on Genetic Algorithm, 224-230.
22. PIRAMUTHU, S., N. RAMAN, AND M. J. SHAW (1994), "Learning-Based Scheduling in a Flexible Manufacturing Flow Line," IEEE Transactions on Engineering Management, 41, 2, 172-182.
23. RIANE, F., H. ARTIBA, AND S. E. ELMAGHRABY (1998a), Sequencing Hybrid Two-Stage Flowshops with Dedicated Machines, Research Report, North Carolina State University, Raleigh, CA, June.
24. _, _, AND _ (1998b), "A Hybrid Three-Stage Flowshop Problem: Efficient Heuristics to Minimize Makespan," European Journal of Operational Research, 109, 2, 321-329.
25. SANTOS, D. L., J. L. HUNSUCKER, AND D. E. DEAL (1995), "Global Lower Bounds for Flowshop with Multiple Processors," European Journal of Operational Research, 80, 1, 112-120.
26. SOEWANDI, H. (1998), Sequencing Jobs on Two- and Three-Stage Hybrid Flowshop to Minimize Makespan, Unpublished Ph.D. thesis, North Carolina State University, Raleigh, NC.
27. SRISKANDARAJAH, C. AND S. P. SETHI (1989), "Scheduling Algorithm for Flexible Flowshops: Worst and Average Case Performance," European Journal of Operational Research, 43, 2, 143-160.
28. TURNER, S. AND D. BOOTH (1987), "Comparison of Heuristics for Flow Shop Sequencing," OMEGA The International Journal of Management Science, 15, 1, 75-78.
29. VIGNIER, A., P. COMMANDEUR, AND C. PROUST (1997), "New Lower Bound for the Hybrid Flowshop Scheduling Problem" in IEEE 6th International Conference on Emerging Technologies and Factory Automation Proceeding, 446-451.
30. YANO, Y., S. KREIPL, AND M. PINEDO (2000), "Heuristics for Minimizing Total Weighted Tardiness in Flexible Flow Shops," Journal of Scheduling, 3, 2, 89-108.