The general lotsizing and scheduling problem

被引：152

作者：

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 条

[11]

Haase K., Lotsizing and Scheduling for Production Planning, (1994)

[12]

Haase K., Capacitated lot-sizing with sequence dependent setup costs, OR Spektrum, 18, pp. 51-59, (1996)

[13]

Kang S., Malik K., Thomas L., Lotsizing and Scheduling on Parallel Machines with Sequence-dependent Setup Costs, (1994)

[14]

Karmarkar U., Schrage L., The deterministic dynamic product cycling problem, Oper Res, 33, pp. 326-345, (1985)

[15]

Kirkpatrick S., Gelatt C., Vecchi M., Optimization by simulated annealing, Science, 220, pp. 671-680, (1983)

[16]

Kuik R., Salomon M., Van Wassenhove L., Batching decisions: Structure and models, Eur J Oper Res, 75, pp. 243-263, (1994)

[17]

Lasdon L., Terjung R., An efficient algorithm for multi-item scheduling, Oper Res, 19, pp. 946-969, (1971)

[18]

Liberatore M., Miller T., A hierarchical production planning system, Interfaces, 15, pp. 1-11, (1985)

[19]

Lin C., Haley K., Sparks C., A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems, Eur J Oper Res, 83, pp. 330-346, (1995)

[20]

Maes J., McClain J., Van Wassenhove L., Multilevel capacitated lotsizing complexity and lp-based heuristics, Eur J Oper Res, 53, pp. 131-148, (1991)

← 1 2 3 →