A note on heuristics of flow-shop scheduling

Operations Research

Volumn 44, Issue 4, 1996, Pages 648-652

  Lai, Tsung Chyan ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; PROCESS CONTROL; SCHEDULING;

FLOW SHOP SCHEDULING; WORST CASE PERFORMANCE RATIO;

PRODUCTION CONTROL;

EID: 0030182439     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.44.4.648     Document Type: Article

References (19)

1. BELLMAN, R., A. O. ESOGBUE AND I. NABESHIMA. 1982. Mathematical Aspects of Scheduling and Applications. Pergamon Press, Oxford.
2. CAMPBELL, H. G., R. A. DUDEK AND M. L. SMITH. 1970. A Heuristic Algorithm for the n Job m Machine Sequencing Problem. Mgmt. Sci. 16, B630-637.
3. CONWAY, R. W., W. L. MAXWELL AND L. W. MILLER. 1967. Theory of Scheduling. Addison-Wesley, Reading, Mass.
4. DANNENBRING, D. G. 1977. An Evaluation of Flow-shop Sequencing Heuristics. Mgmt. Sci. 23, 1174-1182.
5. GAREY, M. R., AND D. S. JOHNSON. 1979. Computers and Intractibility: A Guide to NP-Completeness. Freeman and Company, San Francisco, California.
6. GAREY, M. R., D. S. JOHNSON AND R. SETHI. 1976. The Complexity of Flowshop and Jobshop Scheduling. Math. Opns. Res. 1, 117-129.
7. GONZALEZ, T., AND S. SAHNI. 1978. Flowshop and Jobshop Schedules: Complexity and Approximation. Opns. Res. 26, 36-52.
8. GUPTA, J. N. D. 1971. A Functional Heuristic Algorithm for the Flowshop Scheduling Problem. Opns. Res. Qur. 22, 39-47.
9. HO, J. C., AND Y.-L. CHANG. 1991. A New Heuristic for the n-job, M-machine Flow-Shop Problem. European J. Opnl. Res. 52, 194-202.
10. JOHNSON, S. M. 1954. Optimal Two- and Three-Stage Production Schedules with Setup Times Included. Naval Res. Logist. Quart. 1, 61-68.
11. KING, J. R., AND A. S. SPACHIS. 1980. Heuristics for Flowshop Scheduling. International J. Production Res. 19, 345-357.
12. LENSTRA, J. K., A. H. G. RINNOOY KAN AND P. BRUCKER. 1977. Complexity of Machine Scheduling Problems. Ann. Discrete Math. 1, 343-362.
13. NAWAZ, M., E. ENSCORE, JR. AND I. HAM. 1983. A Heuristic Algorithm for the m Machine n Job Flowshop Sequencing Problem. Omega 11, 91-95.
14. NOWICKI, E., AND C. SMUTNICKI. 1989. Worst-case Analysis of An Approximation Algorithm for Flow-Shop Scheduling. Opus. Res. Lett. 8, 171-177.
15. NOWICKI, E., AND C. SMUTNICKI. 1991. Worst-case Analysis of Dannenbring's Algorithm for Flow-Shop Scheduling. Opus. Res. Lett. 10, 473-480.
16. PAGE, E. S. 1961. An Approach to Scheduling Jobs on Machines. J. Royal Stat. Soc. Series B. 23, 484-492.
17. PALMER, D. S. 1965. Sequencing Jobs Through A Multi-stage Process in the Minimum Total Time - A Quick Method of Obtaining A Near Optimum. Opnl. Res. Quarterly 16, 101-107.
18. TAILLARD, E. 1990. Some Efficient Heuristic Methods for the Flow Shop Sequencing Problem. European J. Opnl. Res. 47, 65-74.
19. WIDMER, M., AND A. HERTZ. 1989. A New Heuristic Method for the Flow Shop Sequencing Problem. European J. Opnl. Res. 41, 186-193.