Relative performance evaluation of permutation and non-permutation schedules in flowline-based manufacturing systems with flowtime objective

International Journal of Advanced Manufacturing Technology

Volumn 23, Issue 11-12, 2004, Pages 820-830

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

^a ANNAMALAI UNIVERSITY   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Flowshops; Missing operations; Non permutation schedules; Total flowtime; Total weighted flowtime

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; JOB ANALYSIS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

FLOWSHOPS; MISSING OPERATIONS; NON-PERMUTATION SCHEDULES; TOTAL FLOWTIME; TOTAL WEIGHTED FLOWTIME;

FLOW PATTERNS;

EID: 3142635093     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00170-003-1661-7     Document Type: Article

References (20)

1. Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Nav Res Log Q 1:61-68
2. Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the n-job, m-machines sequencing problem. Manage Sci 163:630-637
3. Nawaz M, Enscore EE Jr, Ham I (1983) A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA 11:91-95
4. Widmer M, Hertz A (1989) A new heuristic method for the flowshop sequencing problems. Eur J Oper Res 41:186-193
5. Taillard E (1990) Some efficient heuristic methods for the flowshop sequencing problem. Eur J Oper Res 17:65-79
6. maxflowshop problem. Comput Oper Res 17:243-253
7. Ishibuchi H, Misaki S, Tanaka H (1995) Modified simulated annealing algorithm for the flowshop sequencing problem. Eur J Oper Res 81:388-398
8. Ben Daya M, Al-Fawzan (1998) A tabu search approach for the flowshop scheduling problem. Eur J Oper Res 109:88-95
9. Miyazaki 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
10. Rajendran C, Chaudhuri D (1992) An efficient heuristic approach to the scheduling of jobs in a flowshop. Eur J Oper Res 61:318-325
11. Rajendran C (1993) Heuristic algorithm for scheduling in a flowshop to minimize total flowtime. Int J Prod Econ 29:65-73
12. Ho JC (1995) Flowshop sequencing with mean flowtime objective. Eur J Oper Res 81:571-578
13. Rajendran C (1994) A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria. Int J Prod Res 32:2541-2558
14. Gelders LF, Sambandam N (1978) Four simple heuristics for scheduling a flowshop. Int J Prod Res 16:21-238
15. Miyazaki S, Nishiyama N (1980) Analysis for minimizing weighted mean flowtime in flowshop scheduling. J Oper Res Soc Japan 23:118-132
16. Rajendran C, Ziegler H (1997) An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime. Eur J Oper Res 103:129-138
17. Pinedo M (1995) Scheduling: theory, algorithms and systems. Prentice Hall, Englewood Cliffs
18. Dannenbring DG (1977) An evaluation of flowshop sequencing heuristics. Manage Sci 23:1174-1182
19. Blackstone JH, Phillips DT, Hogg GL (1982) A state-of-the-art survey of dispatching rules for manufacturing jobshop operations. Int J Prod Res 20:27-45
20. Giffler B, Thomson GL (1960) Algorithms for solving production scheduling problems. Oper Res 8:487-503