An asymptotic two-phase algorithm to minimize total flow time for a two-machineflowshop

International Journal of Systems Science

Volumn 27, Issue 10, 1996, Pages 925-930

  Pan, Chao Hsien ^a   Wu, Chin Chia ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; HEURISTIC METHODS; OPTIMAL SYSTEMS; SCHEDULING;

TOTAL FLOW TIME MINIMIZATION; TWO-MACHINE FLOWSHOP;

ALGORITHMS;

EID: 0030260149     PISSN: 00207721     EISSN: 14645319     Source Type: Journal    
DOI: 10.1080/00207729608929295     Document Type: Article

References (13)

1. Bagga, P. C., and Kalra, K. R., 1979, Scheduling with minimum sum completion times. Proceedings of the Twelfth Annual Conference of the Operational Research Society of India.
2. Cadambi, B. V., and Sathe, Y. S., 1993, Two-machine flowshop scheduling to minimise mean flow time. Opsearch, 30, 35-41.
3. Campbell, H. G., Dudek, R. A., and Smith, M. L., 1970, A heuristic algorithm for the n-job m-machine sequencing problem. Management Science, 16, 630-637.
4. Fisher, M. L., 1976, A dual algorithm for the one-machine scheduling problem. Mathematical Programming, 11, 229-251.
5. French, S., 1982, Sequencing and Scheduling: an Introduction to the Mathematics of the Job-Shop (Chichester, U.K.: Halsted Press,).
6. Garey, M. R., Johnson, D. S., and Sethi, P. R., 1976, The complexity of flow-shop and job-shop scheduling. Mathematics of Operations Research, 1, 117-129.
7. Gupta, J. N. D., 1972, Heuristic algorithms for multistage flow shop scheduling problem. AIIE Transactions, 4, 11-18.
8. Ho, J. C., and Chang, Y.-L., 1991, A new heuristic for the n-job M-machine flow-shop problem. European Journal of Operational Research, 52, 194-202.
9. Ignall, E., and Schrage, L., 1965, Application of the branch-and-bound technique to some flowshop scheduling problems. Operations Research, 13, 400-412.
10. Nawaz, M., Enscore, E., Jr., and Ham, I., 1983, A heuristic algorithm for the m-machine n-job flow-shop sequencing problem. Omega, 11, 91-95.
11. Smith, W. E., 1956, Various optimizers for single stage production Naval Research Logistics Quarterly, 3, 59-66.
12. Taillard, E., 1990, Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, 47, 65-74.
13. Widmer, M., and Hertz, A., 1989, A new heuristic method for the flow shop sequencing problem. European Journal of Operational Research, 41, 186-193.