DocumentCode
2133617
Title
Disruption Management in JIT Problem of Single Machine Scheduling
Author
Xu, Xu-Song ; Xiao, Lei
Author_Institution
Econ. & Manage. Sch., Wuhan Univ., Wuhan, China
fYear
2009
fDate
20-22 Sept. 2009
Firstpage
1
Lastpage
4
Abstract
This paper discusses the disruption management problem in the middle of the JIT question 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 question which we do not punish but encourage the hardware ahead of schedule. Corresponding to such the disruption management problem, this paper gives neighborhood search algorithm, dynamic planning algorithm and an example.
Keywords
just-in-time; optimisation; single machine scheduling; disruption management; dynamic planning algorithm; just-in-time problem; neighborhood search algorithm; single machine scheduling; Dynamic scheduling; Hardware; Heuristic algorithms; Optimal scheduling; Scheduling algorithm; Single machine scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Management and Service Science, 2009. MASS '09. International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-4638-4
Electronic_ISBN
978-1-4244-4639-1
Type
conf
DOI
10.1109/ICMSS.2009.5303284
Filename
5303284
Link To Document