The general lotsizing and scheduling problem

被引：150
作者：
Fleischmann B. [1 ]
Meyr H. [1 ]
机构：
[1] Department for Production and Logistics, University of Augsburg, D-86 135 Augsburg
来源：
Operations-Research-Spektrum | 1997年 / 19卷 / 1期
关键词：
Local search; Lotsizing; Scheduling; Sequence-dependent setup costs; Threshold accepting;
D O I：
10.1007/BF01539800
中图分类号：
学科分类号：
摘要：
The GLSP (General Lotsizing and Scheduling Problem) addresses the problem of integrating lotsizing and scheduling of several products on a single, capacitated machine. Continuous lotsizes, meeting deterministic, dynamic demands, are determined and scheduled with the objective of minimizing inventory holding costs and sequence-dependent setup costs. As the schedule is independent of predefined time periods, the GLSP generalizes known models using restricted time structures. Three variants of a local search algorithm, based on threshold accepting, are presented. Computational tests show the effectiveness of these heuristic approaches and are encouraging for further extensions of the basic model. © Springer-Verlag 1997.
引用
收藏
页码：11 / 21
页数：10
相关论文
共 25 条
  • [1] Baker T., Muckstadt Jr. J., The Ches Problems, (1989)
  • [2] De Matta R., Guignard M., Studying the effects of production loss due to setup in dynamic production scheduling, Eur J Oper Res, 72, pp. 62-73, (1994)
  • [3] Dixon P.S., Silver E.A., A heuristic solution procedure for the multi-item, single-level, limited capacity, lot-sizing problem, J Oper Manag, 2, pp. 23-39
  • [4] Dueck G., Scheuer T., Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing, J Comp Phys, 90, pp. 161-175, (1990)
  • [5] Dueck G., Scheuer T., Wallmeier H., Anlagenbelegungsplanung und Optimale Steuerung, (1992)
  • [6] Dueck G., Wirsching J., Threshold Accepting Algorithms for Multi-constraint 0-1 Knapsack Problems, (1989)
  • [7] Fleischmann B., The discrete lot-sizing and scheduling problem, Eur J Oper Res, 44, pp. 337-348, (1990)
  • [8] Fleischmann B., The discrete lot-sizing and scheduling problem with sequence-dependent setup costs, Eur J Oper Res, 75, pp. 395-404, (1994)
  • [9] Fleischmann B., Popp T., Das dynamische Losgrößgenproblem mit reihenfolgeabhä ingigen Rüstkosten, Operations Research Proceedings 1988, pp. 510-515, (1989)
  • [10] Garey M., Johnson D., Computers and Intractability: A Guide to the Theory of NP Completeness, (1979)
123