A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem

This paper deals with the total completion time 2-machines flow shop problem. We present a so-called matheuristic post processing procedure that improves the objective function value with respect to the solutions provided by state of the art procedures. The proposed procedure is based on the positional completion times integer programming formulation of the problem with O(n2) variables and O(n) constraints.

[1]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[2]  Talel Ladhari,et al.  Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop , 2009 .

[3]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[4]  Nicolas Monmarché,et al.  An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem , 2002, Eur. J. Oper. Res..

[5]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[6]  Roberto Tadei,et al.  An improved branch-and-bound algorithm for the two machine total completion time flow shop problem , 2002, Eur. J. Oper. Res..

[7]  S. L. Velde.  Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation , 1991 .

[8]  Han Hoogeveen,et al.  Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems , 1992, Math. Program..

[9]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[10]  Maurice Queyranne,et al.  Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling , 1992, IPCO.

[11]  S. Bansal.  Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound Approach , 1977 .

[12]  Edward F. Stafford,et al.  On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem , 1988 .

[13]  Vittorio Maniezzo,et al.  Matheuristics: Hybridizing Metaheuristics and Mathematical Programming , 2009 .

[14]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[15]  Can Akkan,et al.  The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm , 2004, Eur. J. Oper. Res..

[16]  F. D. Croce,et al.  The two-machine total completion time flow shop problem , 1996 .

[17]  Roberto Tadei,et al.  Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems , 2004, J. Heuristics.

[18]  Ping Chen,et al.  An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion , 2009, Comput. Oper. Res..

[19]  Han Hoogeveen,et al.  Lower bounds for minimizing total completion time in a two-machine flow shop , 2006, J. Sched..