Generating non-permutation schedules in flowline-based manufacturing sytems with sequence-dependent setup times of jobs: A heuristic approach

International Journal of Advanced Manufacturing Technology

Volumn 23, Issue 1-2, 2004, Pages 64-78

  Pugazhendhi, S ^a   Thiagarajan, S ^b   Rajendran, Chandrasekharan ^b   Anantharaman, N ^a  

^a ANNAMALAI UNIVERSITY   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; MANUFACTURE; OPTIMIZATION; SCHEDULING;

FLOWLINE-BASED MANUFACTURING SYSTEM (FBMS); RECURSIVE EQUATIONS;

INDUSTRIAL ENGINEERING;

EID: 0842267361     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00170-002-1525-6     Document Type: Article

References (20)

1. Allahverdi A, Gupta JND, Aldowaisan TA (1999) A review of scheduling research involving setup considerations. OMEGA 27:219-239
2. Ben Daya M, Al-Fawzan M, (1998) A tabu search approach for the flowshop scheduling problem. Eur J Oper Res 109:88-95
3. Campball HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the n-job, m-machines sequencing problem, Manage Sci 16(B):630-637
4. Corwin BD, Esogbue AO (1974) Two-machine flowshop scheduling problem with sequence dependent setup times: A dynamic programming approach. Nav Res Log Q 21:515-524
5. Dannenbring DG (1977) An evaluation of flowshop sequencing heuristics. Manage Sci 23:1174-1182
6. Das SR, Gupta JND, Khumawala BM (1995) A savings index heuristic algorithm for flowshop scheduling with sequence-dependent setup times. J Oper Res Soc Japan 46:1365-1373
7. Ho JC (1995) Flowshop sequencing with mean flowtime objective. Eur J Oper Res 81:571-578
8. Ignall E, Schrage L (1965) Application of the branch and bound technique to some flowshop scheduling problems. Oper Res 13:40-412
9. Ishibuchi H, Misaki S, Tanaka H (1995) Modified simulated annealing algorithm for the flowshop sequencing problem. Eur J Oper Res 81:388-398
10. i scheduling problem. Eur J Oper Res 132:439-452
11. Miyasaki S, Nishiyama N, Hashimoto F (1978) An adjacent pair-wise interchange approach to the mean flowtime scheduling problem. J Oper Res Soc Japan 21:287-299
12. Nawaz M, Enscore EE Jr, Ham I (1983) A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA 11:91-95
13. Pinedo M (1995) Scheduling: Theory, algorithms and systems. Prentice Hall, Englewood Cliffs
14. Rajendran C (1993) Heuristic algorithm for scheduling in a flowshop to minimize total flowtime. Int J Prod Econ 29:65-73
15. Rajendran C, Ziegler H (1997a) An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime. Eur J Oper Res 103:129-138
16. Rajendran C, Ziegler H (1997b) A heuristic for scheduling to minimize the sum of weighted flowtime of jobs in a flowshop with sequence dependent setup times. Comput Ind Eng 33:281-284
17. Srikar BN, Ghosh S (1986) A MILP model for the n-job, M-stage flowshop with sequence dependent setup times. Int J Prod Res 24:1459-1474
18. Stafford EF, Tsneg FT (1990) On the Srikar-Ghosh MILP model for the SDST flowshop problem. Int J Prod Res 28:1817-1830
19. Stinton JP, Smith AW (1982) A heuristic programming procedure for sequencing the static flowshop Int J Prod Res 20:753-764
20. Widmer M, Hertz A (1989) A new heuristic method for the flowshop sequencing problems. Eur J Oper Res 41:186-193