Models and algorithms for a two-stage production process

Abstract This paper considers the problem of scheduling and sequencing jobs on machines in a two-stage production process. The problem is motivated by a real-world application concerning a major paper products plant which produces business forms. Here, the printing and the collating operations constitute the two production stages. We develop a model for this problem and propose a solution approach based on the decoupling of the problem into two single stage problems. Each single stage problem, which is the main focus of this paper, is further decomposed into an allocation subproblem and a sequencing subproblem of jobs on machines. Both exact and heuristic algorithms are developed for these subproblems. An overall scheme is proposed for linking together the information and solutions provided by these decomposed system components. Different versions of the algorithm are tested on industrial data, and recommendations are made for implementation.

[1]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[2]  Mandell Bellmore,et al.  Pathology of Traveling-Salesman Subtour-Elimination Algorithms , 1971, Oper. Res..

[3]  Sartaj Sahni,et al.  Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops , 1981, Oper. Res..

[4]  Charles U. Martel,et al.  Preemptive Scheduling with Release Times, Deadlines, and Due Times , 1982, JACM.

[5]  P. Camerini,et al.  On improving relaxation methods by modified gradient techniques , 1975 .

[6]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[7]  Edward K. Baker,et al.  Technical Note - An Exact Algorithm for the Time-Constrained Traveling Salesman Problem , 1983, Oper. Res..

[8]  Bruce L. Golden,et al.  Vehicle Routing with Time-Window Constraints , 1986 .

[9]  M. K. Rajaraman.  A parallel sequencing algorithm for minimizing total cost , 1977 .

[10]  Warren P. Adams,et al.  A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems , 1986 .

[11]  Barbara B. Simons,et al.  Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines , 1983, SIAM J. Comput..

[12]  Edward K. Baker,et al.  Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints , 1986 .

[13]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[14]  Lawrence Bodin,et al.  Approximate Traveling Salesman Algorithms , 1980, Oper. Res..

[15]  David S. Johnson,et al.  Two-Processor Scheduling with Start-Times and Deadlines , 1977, SIAM J. Comput..

[16]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[17]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..

[18]  Sartaj Sahni,et al.  Nearly On Line Scheduling of a Uniform Processor System with Release Times , 1979, SIAM J. Comput..

[19]  Ronald L. Rardin,et al.  Technical Note - Surrogate Constraints and the Strength of Bounds Derived from 0-1 Benders' Partitioning Procedures , 1976, Oper. Res..

[20]  G. Laporte,et al.  Exact Algorithms for the Vehicle Routing Problem , 1987 .

[21]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[22]  H. Sherali,et al.  On the choice of step size in subgradient optimization , 1981 .

[23]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[24]  Lawrence Bodin,et al.  THE STATE OF THE ART IN THE ROUTING AND SCHEDULING OF VEHICLES AND CREWS: EXECUTIVE SUMMARY , 1981 .

[25]  Hanif D. Sherali,et al.  The design of branch and bound algorithms for a class of nonlinear integer programs , 1986 .