论文信息 - A Heuristic for Multi-Product, Multi-Period, Single-Level Batch Production

A Heuristic for Multi-Product, Multi-Period, Single-Level Batch Production

We describe a heuristic procedure for solving multi-product, multi-period, single-level batch-production problems. The method consists of two procedures for a lot-sizing problem with capacity constraints for time-varying demand and a job-shop machine-scheduling problem for given lot sizes, which are applied in succession. We also discuss the performance of the priority rules of the Giffler-Thompson algorithm for solving the job-shop problem.

Klaus Neumann | Matthias Lachmann | K. Neumann | M. Lachmann

[1] Marc Lambrecht,et al. Production scheduling and sequencing for multi-stage production systems , 1979 .

[2] Jan Karel Lenstra,et al. Sequencing and scheduling : an annotated bibliography , 1997 .

[3] Egon Balas,et al. The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[4] E. Silver,et al. A heuristic solution procedure for the multi-item, single-level, limited capacity, lot-sizing problem , 1981 .

[5] P. S. Eisenhut. A Dynamic Lot Sizing Algorithm with Capacity Constraints , 1975 .