Evaluation and comparison of production schedules

被引:40
作者
Kempf, K
Uzsoy, R
Smith, S
Gary, K
机构
[1] Intel Corp, Chandler, AZ 85226 USA
[2] Purdue Univ, Sch Ind Engn, W Lafayette, IN 47907 USA
[3] Arizona State Univ, Dept Comp Sci, Tempe, AZ 85287 USA
关键词
production schedule; real-world factories; design and implementation;
D O I
10.1016/S0166-3615(99)00071-8
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The understanding of what constitutes a "good" production schedule is central to the development and evaluation of automated scheduling systems and their implementation in real-world factories. In this paper, we provide a definition of a schedule and discuss potential uses for a schedule within the organization. We then describe a number of different considerations that must be taken into account when assessing the quality of a schedule, and discuss their implications for the design and implementation of scheduling systems. Published by Elsevier Science B.V.
引用
收藏
页码:203 / 220
页数:18
相关论文
共 66 条
[1]   THE SHIFTING BOTTLENECK PROCEDURE FOR JOB SHOP SCHEDULING [J].
ADAMS, J ;
BALAS, E ;
ZAWACK, D .
MANAGEMENT SCIENCE, 1988, 34 (03) :391-401
[2]  
[Anonymous], 1986, GOAL PROCESS ONGOING
[3]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[4]  
BAI X, 1990, P 9 IEEE INT EL MAN
[6]  
Barr R. S., 1995, Journal of Heuristics, V1, P9, DOI 10.1007/BF02430363
[7]   MATCHUP SCHEDULING WITH MULTIPLE RESOURCES, RELEASE DATES AND DISRUPTIONS [J].
BEAN, JC ;
BIRGE, JR ;
MITTENTHAL, J ;
NOON, CE .
OPERATIONS RESEARCH, 1991, 39 (03) :470-483
[8]  
BHASKARAN K, 1991, HDB IND ENG, pCH83
[9]   SINGLE-MACHINE SCHEDULING TO MINIMIZE WEIGHTED EARLINESS SUBJECT TO NO TARDY JOBS [J].
CHAND, S ;
SCHNEEBERGER, H .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1988, 34 (02) :221-230
[10]   A NOTE ON THE SINGLE-MACHINE SCHEDULING PROBLEM WITH MINIMUM WEIGHTED COMPLETION-TIME AND MAXIMUM ALLOWABLE TARDINESS [J].
CHAND, S ;
SCHNEEBERGER, H .
NAVAL RESEARCH LOGISTICS, 1986, 33 (03) :551-557