We consider the problem of resequencing a set of prearranged jobs when there is limited resequencing flexibility and sequence-dependent changeover costs. Resequencing flexibility is limited by how far forward or backward a job can shift in the sequence relative to its original position. We show how the problem can be solved using dynamic programming in polynomial time with respect to the number of jobs. We also show how the same solution approach can be extended to problems where sequencing constraints are job specific and to problems where job features, which determine changeover costs, are jointly determined with the job sequence. We provide an integer programming formulation to the resequencing problem whose linear programming relaxation offers a useful lower bound. We also describe a family of decomposition heuristics that are easy to customize to provide desired levels of solution quality and solution time. We document the quality of the lower bound from the linear programming relaxation and the upper bound from the heuristic using numerical results. We also provide numerical results to support managerial insights regarding the value of flexibility. We show that the value of flexibility is of the diminishing kind with most of the benefit realized with relatively limited flexibility. We also show that a balanced allocation of flexibility among forward and backward position shifting is superior to an unbalanced one. More significantly, we show that forward and backward position shifting flexibility are complements with the value of one increasing in the amount of the other. Finally, we apply our solution approach to a real-world case from the automotive industry.
[1]
M. Held,et al.
A dynamic programming approach to sequencing problems
,
1962,
ACM National Meeting.
[2]
Roger George Dear.
The dynamic scheduling of aircraft in the near terminal area
,
1976
.
[3]
Maurice Queyranne,et al.
The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
,
1978,
Oper. Res..
[4]
Harilaos N. Psaraftis,et al.
A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
,
1980,
Oper. Res..
[5]
Eugene L. Lawler,et al.
Traveling Salesman Problem
,
2016
.
[6]
N. Biggs.
THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization
,
1986
.
[7]
Clyde L. Monma,et al.
On the Complexity of Scheduling with Batch Setup Times
,
1989,
Oper. Res..
[8]
E. Balas,et al.
New classes of efficiently solvable generalized Traveling Salesman Problems
,
1999,
Ann. Oper. Res..
[9]
David Abramson,et al.
Scheduling Aircraft Landings - The Static Case
,
2000,
Transp. Sci..
[10]
Egon Balas,et al.
Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
,
2000,
INFORMS J. Comput..
[11]
Saif Benjaafar,et al.
Resequencing and feature assignment on an automated assembly line
,
2003,
IEEE Trans. Robotics Autom..