A HEURISTIC SCHEDULING POLICY FOR MULTIITEM, MULTIMACHINE PRODUCTION SYSTEMS WITH TIME-VARYING, STOCHASTIC DEMANDS

被引：8

作者：

GONCALVES, JF

LEACHMAN, RC

GASCON, A

XIONG, ZK

机构：

[1] UNIV CALIF BERKELEY, ENGN SYST RES CTR, BERKELEY, CA 94720 USA

[2] UNIV LAVAL, FAC SCI ADM, RECH & GEST LOGIST GRP, ST FOY, PQ G1K 7P4, CANADA

[3] CHONGQING COMMUN INST, DEPT MANAGEMENT ENGN, SICHUAN, PEOPLES R CHINA

来源：

MANAGEMENT SCIENCE | 1994年 / 40卷 / 11期

关键词：

MACHINE SCHEDULING; LOT-SIZING; STOCHASTIC DEMAND; EOQ;

D O I：

10.1287/mnsc.40.11.1455

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

An effective scheduling policy known as the Dynamic Cycle Lengths Heuristic was introduced by Leachman and Gascon in 1988 for the multi-item, single-machine production system facing stochastic, time-varying demands. In this article we develop a heuristic scheduling policy for the multi-machine extension of the same problem. We integrate the concepts of the Dynamic Cycle Lengths Heuristic with a nonlinear integer optimization model to obtain an overall scheduling policy that allocates items to machines and schedules production quantities during the next time period. We report promising performance in limited simulation tests of the policy.

引用

页码：1455 / 1468

页数：14

共 21 条

[11]

GONCALVES JF, 1987, THESIS U CALIFORNIA

[12] THE MULTI-PRODUCT PRODUCTION CYCLING PROBLEM [J].