A no-wait flowshop scheduling heuristic to minimize makespan

Journal of the Operational Research Society

Volumn 45, Issue 4, 1994, Pages 472-478

  Rajendran, Chandrasekharan ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Flowshop; Heuristics; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FLEXIBLE MANUFACTURING SYSTEMS; INVENTORY CONTROL; JUST IN TIME PRODUCTION; MATHEMATICAL MODELS; OPERATIONS RESEARCH; OPTIMIZATION; PROCESS CONTROL; PRODUCTION CONTROL; SCHEDULING;

BRANCH AND BOUND ALGORITHMS; HEURISTIC ALGORITHM; IN PROCESS INVENTORY; JUST IN TIME MANUFACTURING SYSTEM; MAKESPAN; NO WAIT FLOWSHOP SCHEDULING HEURISTIC;

HEURISTIC METHODS;

EID: 0028413569     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.1994.65     Document Type: Article

References (14)

1. P. C. Gilmore and R E. Gomory (1964) Sequencing a one-state variable machine: a solvable case of the travelling salesman problem, Opns Res. 12, 655-679.
2. S. S. Reddi and C. V Ramamoorthy (1972) On the flowshop sequencing problems with no wait in-process. Opl Res. Q. 23, 323-331.
3. D. A. Wismer (1972) Solution of the flowshop sequencing problem with no intermediate queues. Opns Res. 20, 689-697
4. M. C. Bonney and S. W. Gundry (1976) Solutions to the constrained flowshop sequencing problem. Opl Res. Q. 24, 869-883.
5. J. R. King and A. S. Spachis (1980) Heuristics for flowshop scheduling. Int. J. Prod. Res. 18, 343-357.
6. C. H. Papadimitriou and P. C. Kanellakis (1980) Flowshop scheduling with limited temporary storage. J. Ass. Computing Machinery 27, 533-549.
7. H. Rock (1984) The three-machine no-wait flowshop problem is NP-complete. J. Ass. Computing Machinery 31, 336-345.
8. I. Adiri and D. Pohoryles (1982) Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times. Naval Res. Logist. Q. 29, 495-504.
9. W. Szwarc (1981) A note on flowshop problem without interruptions in job processing. Naval Res. Logist. Q. 28, 665-669.
10. J. M Van Deman and K. R. Baker (1974) Minimizing mean flowtime in the flowshop with no intermediate queues. AIIE Trans. 6, 28-34.
11. C. Rajendran and D. Chaudhuri (1990) Heuristic algorithms for continuous flow-shop problem. Naval Res. Logist. 37, 695-705.
12. S. M. Johnson (1954) Two- and three-stage production schedules with set-up times included. Naval Res. Logist. Q. 1, 61-68.
13. H. G. Campbell, R. A. Dudek and M. L. Smith (1970) A heuristic algorithm for the «-job, m-machine sequencing problem. Mgmt Sci. 16, B630-B637.
14. D. G. Dannenbring (1977) An evaluation of flowshop sequencing heuristics. Mgmt Sci. 23, 1174-1182.