Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups

International Journal of Production Research

Volumn 48, Issue 8, 2010, Pages 2169-2184

  Ying, Kuo Ching ^a   Gupta, Jatinder N D ^b   Lin, Shih Wei ^c   Lee, Zen Jung ^d  

^a NATIONAL TAIPEI UNIVERSITY OF TECHNOLOGY   (Taiwan)

^b UNIVERSITY OF ALABAMA IN HUNTSVILLE   (United States)

^c CHANG GUNG UNIVERSITY   (Taiwan)

^d HUAFAN UNIVERSITY   (Taiwan)

Author keywords

Due dates; Flowshop manufacturing cell; Makespan; Non permutation schedules; Scheduling; Sequence dependent family setups; Simulated annealing algorithm

Indexed keywords

DUE DATES; FLOW-SHOPS; MAKESPAN; MANUFACTURING CELLS; PERMUTATION SCHEDULES; SEQUENCE-DEPENDENT; SIMULATED ANNEALING ALGORITHMS;

ANNEALING; COMPUTATIONAL EFFICIENCY; FLEXIBLE MANUFACTURING SYSTEMS; FLOWLINES; SCHEDULING ALGORITHMS;

SIMULATED ANNEALING;

EID: 77951142861     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540802534707     Document Type: Article

References (26)

1. Allahverdi, A., Gupta, J.N.D., and Aldowaisan, T., 1999. A survey of scheduling research involving setup considerations. OMEGA, International Journal of Management Science, 27 (2), 219-239.
2. Allahverdi, A, et al., 2008. A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187 (3), 985-1032.
3. Cheng, T.C.E, Gupta, J.N.D., and Wang, G., 2000. A review of flowshop scheduling research with setup times. Production and Operations Management, 9 (2), 262-282.
4. Das, S.R. and Canel, C., 2005. An algorithm for scheduling batches of parts in a multi-cell flexible manufacturing system. International Journal of Production Economics, 97 (3), 247-262.
5. França, P.M., et al., 2005. Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups. Computers and Industrial Engineering, 48 (3), 491-506.
6. Frazier, G.V., 1996. An evaluation of group scheduling heuristics in a flow-line manufacturing cell. International Journal of Production Research, 34 (4), 959-976.
7. Gupta, J.N.D and Darrow, W.P., 1986. The two-machine sequence dependent flowshop scheduling problem. European Journal of Operational Research, 24 (3), 439-446.
8. Gupta, J.N.D. and Schaller, J.E., 2006. Minimizing flow time in a flow-line manufacturing cell with family setup times. Journal of the Operational Research Society, 57 (2), 163-176.
9. Hendizadeh, S.H., et al., 2008. Meta-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times. International Journal of Production Economics, 111 (2), 593-605.
10. Lin, S.W. and Ying, K.C., 2009. Applying hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems. International Journal of Production Research, 47 (5), 1411-1424.
11. Lin, S.W., et al., 2009. Using simulated annealing to schedule a flowshop manufacturing cell with sequence dependent family setup times. International Journal of Production Research, DOI: 10.1080/00207540701813210. [In press]
12. Liao, C.J., Liao, L.M., and Tseng, C.T., 2006. A performance evaluation of permutation vs. nonpermutation schedules in a flowshop. International Journal of Production Research, 44 (20), 4297-4309.
13. Logendran, R., deSzoeke, P., and Barnard, F., 2006. Sequence-dependent group scheduling problems in flexible flow shops. International Journal of Production Economics, 102 (1), 66-86.
14. Lazano, S., et al., 1999. A one-step tabu search algorithm for manufacturing cell design. Journal of the Operational Research Society, 50 (5), 509-516.
15. Potts, C.N., Shmoys, D.B., and Williamson, D.P., 1991. Permutation vs. non-permutation flow shop schedules. Operations Research Letters, 10 (5), 282-284.
16. Pugazhendhi, S., et al., 2002. Performance enhancement by using non-permutation schedules in flowline-based manufacturing systems. Computers and Industrial Engineering, 44 (1), 133-157.
17. Pugazhendhi, S., et al., 2004a. Generating non-permutation schedules in flowline-based manufacturing systems with sequence-dependent setup times of jobs: a heuristic approach. International Journal of Advanced Manufacturing Technology, 23 (1-2), 64-78.
18. Pugazhendhi, S., et al., 2004b. Relative performance evaluation of permutation and nonpermutation schedules in flowline-based manufacturing systems. International Journal of Advanced Manufacturing Technology, 23 (11-12), 820-830.
19. Rebaine, D., 2005. Flow shop vs. permutation shop with time delay. Computers and Industrial Engineering, 48 (2), 357-362.
20. Reddy, V. and Narendran, T.T., 2003. Heuristics for scheduling sequence-dependent set-up jobs in flow line cells. International Journal of Production Research, 41 (1), 193-206.
21. Ruben, R.A., Mosier, C.T., and Mahmoodi, F., 1993. A comprehensive analysis of group scheduling heuristics in a job shop cell. International Journal of Production Research, 31 (4), 1343-1369.
22. Schaller, J.E., Gupta, J.N.D., and Vakharia, A.J., 2000. Scheduling a flowline manufacturing cell with sequence dependent family setup times. European Journal of Operational Research, 125 (2), 324-339.
23. Tandon, M., Cummings, P.T., and LeVan, M.D., 1991. Flowshop sequencing with non-permutation schedules. Computers and Industrial Engineering, 15 (8), 601-607.
24. Tiwari, M.K., et al., 2006. Solving part-type and operation allocation problems in an FMS: an approach using constraints-based fast simulated annealing algorithm. IEEE Transaction on System, Man and Cybernetics - Part A: Systems and Human, 36 (6), 1170-1184.
25. Yang, W.H., 2002. Group scheduling in a two-stage flowshop. Journal of the Operational Research Society, 53 (12), 1367-1373.
26. Ying, K.C. and Lin, S.W., 2007. Multi-heuristic desirability ant colony system heuristic for nonpermutation flowshop scheduling problems. International Journal of Advanced Manufacturing Technology, 33 (7-8), 793-802.