Title :
Lower and upper bounds for single machine problem with sequence dependent setup to minimize maximum tardiness
Author :
LUO, Xiaochuan ; WANG, Chengen ; Liu, Zhen ; Qu, Rongxia ; Shu, Qilin
Author_Institution :
Key Lab. of Process Ind. Autom., Northeastern Univ., Shenyang, China
Abstract :
Tardiness is an important measure for customer satisfaction. This paper addresses the lower and upper bounds for the problem of scheduling N jobs on a single machine with due dates, sequence dependent setup times and no preemption where the objective is to minimize the maximum tardiness. Computational experiments demonstrate the effectiveness of the lower and upper bounds.
Keywords :
customer satisfaction; job shop scheduling; minimisation; single machine scheduling; customer satisfaction; job scheduling; maximum tardiness minimization; sequence dependent setup time; single machine scheduling problem; Costs; Customer satisfaction; Job shop scheduling; Laboratories; Manufacturing industries; Manufacturing systems; Processor scheduling; Production systems; Single machine scheduling; Upper bound;
Conference_Titel :
Services Systems and Services Management, 2005. Proceedings of ICSSSM '05. 2005 International Conference on
Print_ISBN :
0-7803-8971-9
DOI :
10.1109/ICSSSM.2005.1499498
