TESTING FEASIBILITY IN A LOT SCHEDULING PROBLEM

被引：7

作者：

ANDERSON, EJ

机构：

来源：

OPERATIONS RESEARCH | 1990年 / 38卷 / 06期

关键词：

ANALYSIS OF ALGORITHMS; COMPUTATIONAL COMPLEXITY; NP-HARDNESS OF A LOT SCHEDULING PROBLEM; PRODUCTION SCHEDULING; HEURISTIC; ECONOMIC LOT SCHEDULING PROBLEM;

D O I：

10.1287/opre.38.6.1079

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, we consider a version of the Economic Lot Scheduling Problem in which there are no costs specified. The usual form of this problem seeks a pattern of production that minimizes the sum of holding the setup costs. We investigate the problem of finding a feasible schedule which avoids a stockout given the initial stocks of the products being manufactured. It is shown that this problem is NP-hard, and an effective heuristic method for its solution is proposed. This heuristic method is compared with a more naive approach to the problem and some computational results are given.

引用

页码：1079 / 1088

页数：10

共 18 条

[11] ON THE GENERAL FEASIBILITY TEST OF SCHEDULING LOT SIZES FOR SEVERAL PRODUCTS ON ONE MACHINE
HSU, WL
[J]. MANAGEMENT SCIENCE, 1983, 29 (01) : 93 - 105
[12] INMAN RR, 1988, 17 NW U DEP IND ENG
[13] THE DETERMINISTIC DYNAMIC PRODUCT CYCLING PROBLEM
KARMARKAR, US
SCHRAGE, L
[J]. OPERATIONS RESEARCH, 1985, 33 (02) : 326 - 345
[14] A HEURISTIC SCHEDULING POLICY FOR MULTI-ITEM, SINGLE-MACHINE PRODUCTION SYSTEMS WITH TIME-VARYING, STOCHASTIC DEMANDS
LEACHMAN, RC
GASCON, A
[J]. MANAGEMENT SCIENCE, 1988, 34 (03) : 377 - 390
[15] SCHEDULING OF ECONOMIC LOT SIZES
MAXWELL, WL
[J]. NAVAL RESEARCH LOGISTICS QUARTERLY, 1964, 11 (2-3): : 89 - &
[16] A COMPUTATIONAL APPROACH TO THE ECONOMIC LOT SCHEDULING PROBLEM
ROGERS, J
[J]. MANAGEMENT SCIENCE, 1958, 4 (03) : 264 - 291
[17] FEASIBILITY OF SCHEDULING LOT SIZES FOR 2 PRODUCTS ON ONE MACHINE
VEMUGANTI, RR
[J]. MANAGEMENT SCIENCE, 1978, 24 (15) : 1668 - 1673
[18] VERGIN RC, 1978, INFOR, V16, P64

← 1 2 →