Performance enhancement by using non-permutation schedules in flowline-based manufacturing systems

Computers and Industrial Engineering

Volumn 44, Issue 1, 2003, Pages 133-157

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

^a ANNAMALAI UNIVERSITY   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Flowline based manufacturing system; Flowshop; Non permutation schedules

Indexed keywords

COMPUTATIONAL METHODS; HEURISTIC METHODS; JOB ANALYSIS; SCHEDULING;

NON-PERMUTATION SCHEDULES (NPS);

INDUSTRIAL MANAGEMENT;

EID: 0037210109     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(02)00189-4     Document Type: Article

References (19)

1. Aarts E.H.L., Van Laarhoven P.J.M., Lenstra J.K., Ulder N.L.J. A computational study of local search algorithms for jobshop scheduling. ORSA Journal of Computing. 6:1994;118-125.
2. Ben Daya M., Al-fawzan. A tabu search approach for the flowshop scheduling problem. European Journal of Operational Research. 109:1998;88-95.
3. Campbell H.G., Dudek R.A., Smith M.L. A heuristic algorithm for the n-job, m-machine sequencing problem. Management Science. 16:1970;B630-B637.
4. Dannenbring D.G. An evaluation of flow-shop sequencing heuristics. Management Science. 23:1977;1174-1182.
5. Garey M.R., Johnson D.S., Sethi R. The complexity of flowshop and job shop scheduling. Mathematics of Operations Research. 1:1976;117-129.
6. Ho J.C. Flowshop sequencing with mean flowtime objective. European Journal of Operational Research. 81:1995;571-578.
7. Ho J.C., Chang Y.L. A new heuristic for the n-job m-machine flowshop problem. European Journal of Operational Research. 52:1991;194-202.
8. Ignall E., Schrage L. Application of the branch and bound technique to some flowshop scheduling problems. Operations Research. 13:1965;400-412.
9. Ishibuchi H., Misaki S., Tanaka H. Modified simulated annealing algorithm for the flow-shop sequencing problems. European Journal of Operational Research. 81:1995;388-398.
10. i scheduling problem. European Journal of Operational Research. 132:2001;439-452.
11. Miyazaki S., Nishiyama N., Hashimoto F. An adjacent pair wise approach to the mean flow time scheduling problem. Journal of the Operations Research Society of Japan. 21:1978;287-299.
12. Nawaz M., Enscore E.E. Jr., Ham I. A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA. 11:1983;91-95.
13. Ogbu F.A., Smith D.K. The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem. Computers and Operations Research. 17:1990;243-253.
14. Osman I.H., Potts C.N. Simulated annealing for permutation flowshop scheduling. OMEGA. 17:1989;551-557.
15. Rajendran C. Heuristic algorithm for scheduling in a flow shop to minimize total flow time. International Journal of Production Economics. 29:1993;65-73.
16. Rajendran C. A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria. International Journal of Production Research. 32:1994;2541-2558.
17. Rajendran C., Chaudhuri D. An efficient heuristic approach to the scheduling of jobs in a flow shop. European Journal of Operational Research. 61:1992;318-325.
18. Taillard E. Some efficient heuristic methods for the flowshop sequencing problem. European Journal of Operational Research. 47:1990;65-79.
19. Widmer M., Hertz A. A new heuristic method for the flowshop sequencing problem. European Journal of Operational Research. 41:1989;186-193.