DLSP for two-stage multi-item batch production
Open Access
- 1 April 1994
- journal article
- research article
- Published by Informa UK Limited in International Journal of Production Research
- Vol. 32 (4), 755-768
- https://doi.org/10.1080/00207549408956968
Abstract
The standard mixed-integer linear model formulation for the multi-item discrete lot-sizing and scheduling problem (DLSP) is extended by additional partially nonlinear constraints for the case of two-stage batch production. The corresponding feasibility problem is NP-complete in the case of non-zero setup limes. A simulated annealing approach is suggested for computing production schedules on both stages. Numerical results are presented.Keywords
This publication has 13 references indexed in Scilit:
- Job Shop Scheduling by Simulated AnnealingOperations Research, 1992
- Multilevel capacitated lotsizing complexity and LP-based heuristicsEuropean Journal of Operational Research, 1991
- The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problemComputers & Operations Research, 1990
- Analysis of relaxations for the multi-item capacitated lot-sizing problemAnnals of Operations Research, 1990
- A simulated annealing approach to scheduling a manufacturing cellNaval Research Logistics (NRL), 1990
- Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristicEuropean Journal of Operational Research, 1990
- A controlled search simulated annealing method for the single machine weighted tardiness problemAnnals of Operations Research, 1989
- Simulated Annealing: Theory and ApplicationsPublished by Springer Science and Business Media LLC ,1987
- Convergence and finite-time behavior of simulated annealingAdvances in Applied Probability, 1986
- Deterministic Production Planning: Algorithms and ComplexityManagement Science, 1980