Fragmental Optimization on the 2-machine Bicriteria Flowshop Scheduling Problem

Proceedings of the International Conference on Tools with Artificial Intelligence

Volumn , Issue , 2003, Pages 194-198

  Huang, Gaofeng ^a   Lim, Andrew ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; HEURISTIC METHODS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

FLOWSHOP SCHEDULING PROBLEMS; SEARCH STRATEGIES;

OPERATIONS RESEARCH;

EID: 0345097625     PISSN: 10636730     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. C. Chen and R. Bulfin. Complexity results for multi-machine multi-criteria scheduling problems. In Proceedings of the Third Industrial Engineering Research Conference, 1994.
2. R. W. Conway, W. L. Maxwell, and L. W. Miller. Theory of Scheduling. Addison Wesley, Reading, Mass., USA, 1967.
3. J. N. D. Gupta, K. Hennig, and F. Werner. Local search heuristics for two-stage flow shop problems with secondary criterion. Computers & Operations Research, 29:123-149, 2002.
4. J. N. D. Gupta, V. R. Neppalli, and F. Werner. Minimizing total flow time in a two-machine flowshop problem with minimum makespan. International Journal of Production Economics, 69:323-338, 2001.
5. J. N. D. Gupta, N. Palanimuthu, and C.-L. Chen. Designing a tabu search algorithm for the two-stage flowshop problem with secondary criterion. Production Planning and Control, 10:251-265, 3 1999.
6. S. M. Johnson. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1:61-68, 1954.
7. V. R. Neppalli, C.-L. Chen, and J. N. Gupta. Genetic algorithm for the two-stage bicriteria flowshop problem. European Journal of Operational Research, 95:356-373, 1996.
8. C. Rajendran. Two-stage flow shop scheduling problem with bicriteria. Journal of the Operational Research Society, 43:871-884, 9 1992.
9. V. T'Kindt, J. N. D. Gupta, and J.-C. Billaut. A branch-and-bound algorithm to solve a two-machine bicriteria flowshop scheduling problem. In ORP3, Paris, September 2001.
10. V. T'Kindt, N. Monmarche, F. Tercinet, and D. Laugt. An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. European Journal of Operational Research, 142:250-257, 2002.