An exact parallel method for a bi-objective permutation flowshop problem

European Journal of Operational Research

Volumn 177, Issue 3, 2007, Pages 1641-1655

  Lemesre, J ^a   Dhaenens, C ^a   Talbi, E G ^a  

^a UNIV LILLE   (France)

Author keywords

Bi objective combinatorial optimization problem; Exact method; Parallel method; Permutation flowshop

Indexed keywords

COMBINATORIAL MATHEMATICS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION; FLOWSHOP PROBLEMS; PARALLEL METHOD; PERMUTATION FLOWSHOP;

OPERATIONS RESEARCH;

EID: 33750743054     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.10.011     Document Type: Article

References (24)

1. Geoffrion A. Proper efficiency and theory of vector maximization. Journal of Mathematical Analysis and Applications 22 (1968) 618-630
2. Ulungu E., and Teghem J. The two phases method: An efficient procedure to solve bi-objective combinatorial optimization problems. Foundations of Computing and Decision Sciences 20 2 (1995) 149-165
3. Graham R.L., Lawler E.L., Lenstra J.K., and Kan A.H.G.R. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5 (1979) 287-326
4. Ehrgott M., and Gandibleux X. A survey and annoted bibliography of multiobjective combinatorial optimization. OR Spektrum 22 4 (2000) 425-460
5. T'Kindt V., and Billaut J.-C. Multicriteria Scheduling: Theory Models and Algorithms (2002), Springer-Verlag
6. Haimes Y., Ladson L., and Wismer D. On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Transaction on system Man and Cybernetics 1 (1971) 296-297
7. Visée M., Teghem J., Pirlot M., and Ulungu E. Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem. Journal of Global Optimization 12 (1998) 139-155
8. Martello S., and Toth P. Knapsack Problems: Algorithms and Computer Implementations (1990), John Wiley & Sons, New York
9. M. Simonard, Programmation Linéaire, vol. 2, Dunod, Paris, 1973.
10. Sayin S., and Karabati S. A bicriteria approach to the two-machine flow shop scheduling problem. European Journal of Operational Research 113 (1999) 435-449
11. Rajendran C. Heuristics for scheduling in flowshop with multiple objectives. European Journal of Operational Research 82 (1995) 540-555
12. Nagar A., Haddock J., and Heragu S. Multiple and bicriteria scheduling: A litterature survey. European Journal of Operational Research 81 (1995) 88-104
13. Sivrikaya F., and Ulusoy G. A bicriteria two-machine permutation flowshop problem. European Journal of Operational Research 107 (1998) 414-430
14. Garey M., Johnson D., and Sethi R. The complexity of flow-shop and job-shop scheduling. Mathematics of Operations Research 1 (1976) 117-129
15. Du J., and Leung J.Y.-T. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15 (1990) 483-495
16. Lageweg B., Lenstra J., and Kan A.R. A general bounding scheme for the permutation flow-shop problem. Operations Research 26 1 (1978) 53-67
17. Johnson S. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-68
18. J. Jackson, An extension of Johnson's results on job-lot scheduling, Naval Research Logistics Quarterly 3.
19. L. Mitten, Sequencing n jobs on two machines with arbitrary time lags, Management Science 5 (3).
20. Kim Y.-D. Minimizing total tardiness in permutation flowshops. European Journal of Operational Research 33 (1995) 541-551
21. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
22. Demirkol E., Mehta S., and Uzsoy R. Benchmarks for shop scheduling problems. European Journal of Operational Research 109 1 (1998) 137-141
23. Reeves C. A genetic algorithm for flowshop sequencing. Computers and Operations Research 22 (1995) 5-13
24. M. Basseur, J. Lemesre, C. Dhaenens, E.-G. Talbi, Cooperation between branch and bound and evolutionary approaches to solve a biobjective flow shop problem, in: Workshop on Experimental and Efficient Algorithms (WEA'04), Rio de Janeiro, Brasil, 2004, pp. 72-86.