Models and algorithms for a two-stage production process
- 1 January 1990
- journal article
- research article
- Published by Taylor & Francis in Production Planning & Control
- Vol. 1 (1) , 27-39
- https://doi.org/10.1080/09537289008919291
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.Keywords
This publication has 23 references indexed in Scilit:
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming ProblemsManagement Science, 1986
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman ProblemOperations Research, 1983
- Routing and scheduling of vehicles and crewsComputers & Operations Research, 1983
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxationsMathematical Programming, 1981
- On the choice of step size in subgradient optimizationEuropean Journal of Operational Research, 1981
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- State‐space relaxation procedures for the computation of bounds to routing problemsNetworks, 1981
- Approximate Traveling Salesman AlgorithmsOperations Research, 1980
- Two-Processor Scheduling with Start-Times and DeadlinesSIAM Journal on Computing, 1977
- Pathology of Traveling-Salesman Subtour-Elimination AlgorithmsOperations Research, 1971