Minimizing the mean flow time in a two-machine group-scheduling problem with carryover sequence dependency

Robotics and Computer-Integrated Manufacturing

Volumn 19, Issue 1-2, 2003, Pages 21-33

  Logendran, Rasaratnam ^a   Gelogullari, Cumhur A ^a   Sriskandarajah, Chelliah ^b  

^a OREGON STATE UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

Carryover sequence dependency; Electronics manufacturing; Group scheduling; Lower bound; Tabu search

Indexed keywords

ALGORITHMS; PRINTED CIRCUIT MANUFACTURE; PRODUCTION CONTROL; SCHEDULING; TREES (MATHEMATICS);

CARRYOVER SEQUENCE DEPENDENCY; GROUP SCHEDULING;

COMPUTER INTEGRATED MANUFACTURING;

EID: 0037329238     PISSN: 07365845     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0736-5845(02)00059-5     Document Type: Conference Paper

References (28)

1. Yoshida T., Hitomi K. Optimal two-stage production scheduling with setup times separated. AIIE Trans. 11:1979;261-263.
2. Sule D.R. Sequencing n jobs on two machines with setup, processing and removal times separated. Nav Res Logistics Q. 29:1982;517-519.
3. Radharamanan R. A heuristic algorithm for group scheduling. Proceedings of the International Industrial Engineering Conference, 1986. Dallas, Texas. p. 229-36.
4. Al-Qattan I. Designing GT cells enhanced by group scheduling: key to flexible manufacturing system. Proceedings of the IIE Integrated Systems Conference, 1988. St. Louis, Missouri. p. 25-30.
5. Allison JD.Combining Petrov's heuristic and the CDS heuristic in group scheduling problems. Proceedings of the 12th Annual Conference on Computers and Industrial Engineering, 1990. Orlando, Florida. p. 457-61.
6. Proust C., Gupta J.N.D., Deschamps V. Flowshop scheduling with set-up, processing and removal time separated. Int J Prod Res. 29:1991;479-493.
7. Logendran R., Nudtasomboon N. Minimizing the makespan of a group scheduling problem. a new heuristic Int J Prod Econom. 22:1991;217-230.
8. Logendran R., Mai L., Talkington D. Combined heuristics for bi-level group scheduling problems. Int J Prod Econom. 38(2-3):1995;133-145.
9. McGinnis L.F., Ammons J.C., Carlyle M., Cranmer L., Depuy G.W., Ellis K.P., Tovey C.A., Xu H. Automated process planning for printed circuit card assembly. IIE Trans. 24(4):1992;18-30.
10. Uzsoy R., Lee C-.Y., Martin-Vega L.A. A review of production planning and scheduling models in the semiconductor industry part I. system characteristics, performance evaluation and production planning IIE Trans. 26(5):1992;47-61.
11. Uzsoy R., Lee C-.Y., Martin-Vega L.A. A review of production planning and scheduling models in the semiconductor industry part II. shop-floor control IIE Trans. 26(5):1994;44-55.
12. Ammons J.C., Carlyle M., Cranmer L., Depuy G.W., Ellis K.P., McGinnis L.F., Tovey C.A., Xu H. Component allocation to balance workload in printed circuit card assembly systems. IIE Trans. 29(4):1997;265-276.
13. Ahmadi J., Grotzinger S., Johnson D. Component allocation and partitioning for a dual delivery placement machine. Oper Res. 36:1988;176-191.
14. Ahmadi R.H., Kouvelis P. Staging problem of a dual delivery pick-and-place machine in printed circuit card assembly. Oper Res. 42(1):1994;81-91.
15. Ben-Arieh D., Dror M. 1990, Part assignment to electronic insertion machines. two machine case Int J Prod Res. 28(7):1990;1317-1327.
16. Brandeau M.L., Billington C.A. Design of manufacturing cells. operations assignment in oriented circuit board manufacturing J Intell Manuf. 2:1991;95-106.
17. Hillier M.S., Brandeau M.L. Optimal component assignment and board grouping in printed circuit board manufacturing. Oper Res. 46(5):1998;675-689.
18. Lofgren CB, McGinnis LF. Dynamic scheduling for flexible printed circuit card assembly. Proceedings of the IEEE Conference on Systems, Man, and Cybernetics, 1986. Atlanta, Georgia. p. 1294-7.
19. Leon V.J., Peters B.A. A comparison of setup strategies for printed circuit board assembly. Comput Ind Eng. 34(1):1998;219-234.
20. Tang C.S., Denardo E.V. Models arising from a flexible manufacturing machine, part I. minimization of the number of tool switches Oper Res. 36(5):1988;767-777.
21. Garey M.R., Johnson D.S., Sethi R.R. The complexity of flowshop and jobshop scheduling. Math Oper Res. 1:1976;117-129.
22. Ham I., Hitomi K., Yoshida T. Group technology. 1985;Kluwer Academic Publishers, Dordrecht.
23. Glover F. Tabu-search. a tutorial Interfaces. 20:1990;79-94.
24. Logendran R., Sonthinen A. Tabu search-based approach for scheduling job-shop type flexible manufacturing systems. J Oper Res Soc. 48:1997;264-277.
25. Logendran R, Subur F. Real-time scheduling with job-splitting on unrelated-parallel machines. Proceedings of the Seventh Annual Industrial Engineering Research Conference (CD ROM), 1998. Banff, Canada.
26. Johnson S.M. Optimal two- and three-stage production schedules with set-up times included. Nav Res Logistics Q. 1:1954;61-68.
27. Montgomery D.C. Design and analysis of experiments. 2001;Wiley, New York.
28. MathSoft Inc.S-Plus, Data Analysis Products Division, Seattle, Washington, USA, 1997.