Two-machine flowshop scheduling with bicriteria problem

Computers and Industrial Engineering

Volumn 36, Issue 3, 1999, Pages 549-564

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

^a VAN NUNG INSTITUTE OF TECHNOLOGY   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; INDUSTRIAL MANAGEMENT; OPTIMIZATION; PRODUCTION CONTROL;

BICRITERIA SCHEDULING; HEURISTIC SCHEDULING ALGORITHM; TWO MACHINE FLOWSHOP;

SCHEDULING;

EID: 0033161818     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0360-8352(99)00149-7     Document Type: Article

References (17)

1. Baker KR. Introduction to sequencing and scheduling. New York: Wiley, 1974.
2. Church LK, Uzsoy R. Analysis of periodic and event-driven rescheduling policies in dynamic shops. International Journal of Computer Integrated Manufacturing 1992;5(3):153-63.
3. Croce FD, Narayan V, Tadei R. The two-machine total completion time flow shop problem. European Journal of Operational Research 1996;90:227-37.
4. French S. Sequencing and scheduling: an introduction to the mathematics of the job-shop. Chichester: Ellis Horwood, 1982.
5. Gonzalez T, Sahni S. Flowshop and jobshop schedules: complexity and approximation. Operations Research 1978;26(1):36-52.
6. Hoogeveen JA, Van De Velde SL. Stronger Lagrangian bounds by use of slack variables: application to machine scheduling problem. In: Proceedings of the Third IPCO Conference, Erice, Italy, 1993. p. 195-208.
7. Ignall E, Schrage LE. Application of the branch and bound technique to some flowshop scheduling problems. Operations Research 1965;13:400-12.
8. Johnson SM. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1954;1:61-8.
9. Kohler WH, Steiglitz K. Exact, approximate and guaranteed accuracy algorithms for the flowshop problem n - 2-F-F̄. Journal of the Association for Computing Machinery 1975;22:106-14.
10. Nagar A, Heragu SS, Haddock J. A branch and bound approach for a two-machine flowshop scheduling problem. Journal of the Operational Research Society 1995;46:721-34.
11. Nagar A, Heragu SS, Haddock J. A combined branch and bound and genetic algorithm based approach for a flowshop scheduling problem. Annals of Operations Research 1996;63:397-414.
12. Rajendran C. Two-stage flowshop scheduling problem with bicriteria. Journal of the Operational Research Society 1992;43:871-84.
13. Roy U, Zhang X. A heuristic approach to n/m job shop scheduling: fuzzy dynamic scheduling algorithms. Production Planning and Control 1996;7(3):299-311.
14. Selen WJ, Hott D. A mixed integer goal programming formulation of the standard flowshop scheduling problem. Journal of the Operational Research Society 1986;37:1121-8.
15. Sun D, Lin L. A dynamic job shop scheduling framework: a backward approach. International Journal of Production Research 1994;32(4):967-85.
16. Van De Velde SL. Minimizing the sum of job completion times in the two-machine flow shop by Lagrangian relaxation. Annals of Operations Research 1990;26:257-68.
17. Wilson JM. Alternative formulations of a flowshop scheduling problem. Journal of the Operational Research Society 1989;40:395-9.