A matheuristic approach for the total completion time two-machines permutation flow shop problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6622 LNCS, Issue , 2011, Pages 38-47

  Della Croce, Federico ^a,b   Grosso, Andrea ^a,b   Salassa, Fabio ^a,b  

^a POLITECNICO DI TORINO   (Italy)

^b UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETION TIME; FLOW SHOP PROBLEMS; INTEGER PROGRAMMING FORMULATIONS; OBJECTIVE FUNCTION VALUES; PERMUTATION FLOW SHOPS; POST-PROCESSING PROCEDURE; STATE-OF-THE-ART PROCEDURES; TOTAL COMPLETION TIME;

COMBINATORIAL OPTIMIZATION; MACHINE SHOP PRACTICE; OPTIMIZATION;

INTEGER PROGRAMMING;

EID: 79955771899     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20364-0_4     Document Type: Conference Paper

References (21)

1. Akkan, C., Karabati, S.: The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm. European Journal of Operational Research 159, 420-429 (2004)
2. Bansal, S.P.: Minimizing the sum of completion times of n-jobs over M-machines in a flowshop. AIIE Transactions on a Branch and Bound Approach 9, 306-311 (1977)
3. Della Croce, F., Ghirardi, M., Tadei, R.: An improved branch-and-bound algorithm for the two machine total completion time flow shop problem. European Journal of Operational Research 139, 293-301 (2002)
4. Della Croce, F., Ghirardi, M., Tadei, R.: Recovering Beam Search: enhancing the beam search approach for combinatorial optimization problems. Journal of Heuristics 10, 89-104 (2004)
5. Della Croce, F., Narayan, V., Tadei, R.: The two-machine total completion time flow shop problem. European Journal of Operational Research 90, 227-237 (1996)
6. Della Croce, F., Salassa, F.: A Variable Neighborhood Search Based Matheuristic for Nurse Rostering Problems. In: Proceedings of 8th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2010, Belfast, UK, August 10-13 (2010)
7. Dong, X., Huang, H., Chen, P.: An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion. Computers & Operations Research 36, 1664-1669 (2009)
8. Fischetti, M., Lodi, A.: Local Branching. Mathematical Programming B 98, 23-47 (2003)
9. Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1, 117-129 (1976)
10. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Operations Research 5, 287-326 (1979)
11. Hansen, P., Mladenovic, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research 130, 449-467 (2001)
12. Hoogeveen, H., van Norden, L., van de Velde, S.: Lower bounds for minimizing total completion time in a two-machine flow shop. Journal of Scheduling 9, 559-568 (2006)
13. Hoogeveen, J.A., Van de Velde, S.L.: Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems. Mathematical Programming 70, 173-190 (1995)
14. Ladhari, T., Rakrouki, M.A.: Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop. International Journal of Production Economics 122, 678-691 (2009)
15. Lasserre, J.B., Queyranne, M.: Generic scheduling polyhedral and a new mixed integer formulation for single machine scheduling. In: Proceedings of the IPCO Conference (1992)
16. Maniezzo, V., Stutzle, T., Voss, S.: Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. Annals of Information Systems 10 (2009)
17. Ruiz, R., Maroto, C.: A comprehensive review and evaluation of permutation flow-shop heuristics. European Journal of Operational Research 165, 479-494 (2005)
18. Taillard, E.: Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 47, 65-74 (1990)
19. T'kindt, V., Monmarché, N., Laugt, D., Tercinet, F.: An Ant Colony Optimization Algorithm to Solve a 2-Machine Bicriteria Flowshop Scheduling Problem. European Journal of Operational Research 142, 250-257 (2002)
20. Stafford, E.F.: On the development of a mixed integer linear programming model for the flowshop sequencing problem. Journal of the Operational Research Society 39, 1163-1174 (1988)
21. Van de Velde, S.: Minimizing the sum of job completion times in the two-machine flowshop by Lagrangean relaxation. Annals of Operations Research 26, 257-268 (1990)