DocumentCode :
612899
Title :
Single machine scheduling with past-sequence-dependent delivery times and learning effect
Author :
Zhanguo Zhu ; Ming Liu ; Feng Chu ; Yunfei Fang
Author_Institution :
Coll. of Econ. & Manage., Nanjing Agric. Univ., Nanjing, China
fYear :
2013
fDate :
10-12 April 2013
Firstpage :
574
Lastpage :
578
Abstract :
This paper studies single-machine scheduling problem with time-dependent delivery times and learning effect. The delivery time of a job is proportional to its waiting time in the system, i.e., the length of the already scheduling jobs. That is, the delivery times are past-sequence-dependent (psd). Delivery time denotes the time a job required to be delivered to the customer. It is assumed that the learning process reflects a decrease in the process time as a function of the number of repetitions, i.e., as a function of the job position in the sequence. We respectively consider the following objectives: the minimization of the makespan, the total completion time, the total absolute differences in completion times and the sum of earliness, tardiness and common due date penalty. We develop polynomial time algorithms to optimally solve these problems.
Keywords :
computational complexity; minimisation; single machine scheduling; common due date penalty; earliness penalty; job position function; job waiting time; learning effect; makespan minimization; past-sequence-dependent delivery times; penalty sum; polynomial time algorithms; single machine scheduling problem; tardiness penalty; time-dependent delivery times; total absolute completion time difference; Europe; Job shop scheduling; Minimization; Processor scheduling; Single machine scheduling; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Networking, Sensing and Control (ICNSC), 2013 10th IEEE International Conference on
Conference_Location :
Evry
Print_ISBN :
978-1-4673-5198-0
Electronic_ISBN :
978-1-4673-5199-7
Type :
conf
DOI :
10.1109/ICNSC.2013.6548802
Filename :
6548802
Link To Document :
بازگشت