An Emergency Management Problem Based on Dynamic Planning Algorithm

被引:0
作者
Xu Xusong [1 ]
Chen Mei [1 ]
机构
[1] Wuhan Univ, Econ & Management Sch, Wuhan, Peoples R China
来源
MOT2009: PROCEEDINGS OF ZHENGZHOU CONFERENCE ON MANAGEMENT OF TECHNOLOGY, VOLS I AND II | 2009年
关键词
Emergency management; dynamic planning algorithm; TARDINESS PENALTIES; SINGLE-MACHINE; DATE; EARLINESS; SEQUENCE; COMMON;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper discusses the emergency management problem in the middle of the JIT based on common due date: if a hardware has been finished ahead of schedule, measures have to be adopted - the hardware has to be arranged over again in order to reach the optimization. In addition, this paper discusses the problem which we do not punish but encourage the hardware ahead of schedule. Corresponding to such the disruption management problem, this paper gives dynamic planning algorithm and an example.
引用
收藏
页码:373 / 375
页数:3
相关论文
共 10 条
[1]  
Baker K. R., 1974, Introduction to Sequencing and Scheduling"
[2]   SEQUENCING WITH EARLINESS AND TARDINESS PENALTIES - A REVIEW [J].
BAKER, KR ;
SCUDDER, GD .
OPERATIONS RESEARCH, 1990, 38 (01) :22-36
[3]   DETERMINATION OF AN OPTIMAL COMMON DUE DATE AND OPTIMAL SEQUENCE IN A SINGLE-MACHINE JOB SHOP [J].
BECTOR, CR ;
GUPTA, YP ;
GUPTA, MC .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1988, 26 (04) :613-628
[4]  
Chen B, 1998, HDB COMBINATORIAL OP
[5]   SURVEY OF SCHEDULING RESEARCH INVOLVING DUE DATE DETERMINATION DECISIONS [J].
CHENG, TCE ;
GUPTA, MC .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 38 (02) :156-166
[6]  
Graham R. L., 1979, Discrete Optimisation, P287
[7]   MINIMIZING WEIGHTED NUMBER OF TARDY JOBS AND WEIGHTED EARLINESS TARDINESS PENALTIES ABOUT A COMMON DUE DATE [J].
LEE, CY ;
DANUSAPUTRO, SL ;
LIN, CS .
COMPUTERS & OPERATIONS RESEARCH, 1991, 18 (04) :379-389
[8]  
Sware W, 1996, COMPUTERS OPNS RES, V23, P255
[10]   Multifleet routing and multistop flight scheduling for schedule perturbation [J].
Yan, SY ;
Tu, YP .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 103 (01) :155-169