A two-machine flowshop scheduling heuristic with bicriteria objective

International Journal of Industrial Engineering : Theory Applications and Practice

Volumn 5, Issue 2, 1998, Pages 128-139

  Lee, Ching En ^a   Chou, Fuh Der ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Bicriteria Scheduling; Makespan; Total Flow Time; Two Machine Flowshop

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; PROCESS CONTROL; SCHEDULING;

BICRITERIA SCHEDULING; TWO-MACHINE FLOWSHOP SCHEDULING;

PRODUCTION CONTROL;

EID: 0032098647     PISSN: 10724761     EISSN: 1943670X     Source Type: Journal    
DOI: None     Document Type: Article

References (27)

1. Ahmadi, R. H. and Bagchi, U. (1990). Improved Lower Bounds for Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flow shop. European Journal of Operational Research, 44: 331-336.
2. Baker, K. R. (1974). Introduction to Sequencing and Scheduling. John Wiley, New York, NY.
3. Cambell, 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. Conway, R. W., Maxwell, W. L. and Miller, L. W. (1967). The Theory of Scheduling. Addison-Wesley, MA.
5. Croce, F. D., V. Narayan and Tadei, R. (1996). The Two-Machine Total Completion Time Flow Shop Problem. European Journal of Operational Research, 90: 227-237.
6. Dannenbring, D. G. (1977). An Evaluation of Flow-Shop Sequencing Heuristics. Management Science, 23: 1174-1182.
7. French, S. (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Ellis Horwood, Chichester.
8. Gangadharan, R. and Rajendran, C. (1994). A Simulation Annealing Heuristic for Scheduling in a Flowshop with Bicriteria. Computers & Industrial Engineering, 27(4), 43-476.
9. Gonzalez, T. and Sahni, S. (1978). Flowshop and Jobshop Schedules: Complexity and Approximation. Operations Research, 26(1): 36-52.
10. Hoogeveen, J. A. and Van De Velde, S. L. (1993). Stronger Lagrangian Bounds by Use of Slack Variables: Application to Machine Scheduling Problem. Proceedings of the Third IPCO Conference, Erice, Italy, pp. 195-208.
11. Ignall, E. and Schrage, L. E. (1965). Application of the Branch and Bound Technique to Some Flowshop Scheduling Problems. Operations Research, 13: 400-412.
12. Johnson, S. M. (1954). Optimal Two- and Three-Stage Production Schedules with Setup Times Included. Naval Research Logistics Quarterly, 1: 61-68.
13. Kohler, W. H. and Steiglitz, K. (1975). Exact, Approximate and Guaranteed Accuracy Algorithms for the Flowshop problem n-2-F-F̄. Journal of the Association for Computing Machinery, 22: 106-114.
14. Lomnicki, Z. (1965). A Branch and Bound Algorithm for the Exact Solution of the Three-Machine Scheduling Problem. Operational Research Quarterly, 16: 89-100.
15. Nagar, A., Haddock, J. and Heragu, S. S. (1995). Multiple and Bicriteria Scheduling: A Literature Survey. European Journal of Operational Research, 81: 88-104.
16. Nagar, A., Heragu, S. S. and Haddock, J. (1995). A Branch and Bound Approach for a Two-Machine Flowshop Scheduling Problem. Journal of the Operational Research Society, 46: 721-734.
17. Nagar, A., Heragu, S. S. and Haddock, J. (1996). A Combined Branch and Bound and Genetic Algorithm Based Approach for a Flowshop Scheduling Problem. Annals of Operations Research, 63: 397-414.
18. Nawaz, M., Enscore, J. and Ham, I. (1983). A Heuristic Algorithm for the m-Machine, n-Job Flowshop Sequencing Problem. OMEGA, 11: 91-95.
19. max G Flowshop Problem. Computers & Operations Research, 17: 243-253.
20. Osman, I. H. and Potts, C. N. (1989). Simulation Annealing for Permutation Flowshop Scheduling. OMEGA, 17: 551-557.
21. Page, E. S. (1961). An approach to the Scheduling of Jobs on Machines. Journal of the Royal Statistical Society, Series B(23): 484-492.
22. Palmer, D. S. (1965). Sequencing Jobs through a Multi-Stage Process in the Minimum Total Time : A Quick Method Obtaining a Near Optimum. Operational Research Quarterly, 16: 101-107.
23. Rajendran, C. (1992). Two-Stage Flowshop Scheduling Problem with Bicriteria. Journal of the Operational Research Society, 43: 871-884.
24. Reeves, C. R. (1994). A Genetic Algorithm for Flowshop Sequencing. Computers & Operations Research, 22, 5-13.
25. Selen, W. J. and Hott, D. (1986). A Mixed Integer Goal Programming Formulation of the Standard Flowshop Scheduling Problem. Journal of the Operational Research Society, 37: 1121-1128.
26. Van De Velde, S. L. (1990). Minimizing the Sum of Job Completion Times in the Two-Machine Flow Shop by Lagrangian Relaxation. Annals of Operations Research, 26: 257-268.
27. Wilson, J. M. (1989). Alternative Formulations of a Flowshop Scheduling Problem. Journal of the Operational Research Society, 40: 395-399.