DocumentCode
3144141
Title
Minimizing the weighted number of early and tardy jobs with bounded batch
Author
Zhao, Hongluan ; Fu, Baibai ; Han, Guoyong ; Zhao, Linsheng
Author_Institution
Dept. of Comput. Sci. & Technol., Shandong Jianzhu Univ., Jinan, China
Volume
7
fYear
2010
fDate
16-18 Oct. 2010
Firstpage
2918
Lastpage
2922
Abstract
Processing jobs individually is extended to the situation where the jobs can be formed in batches to minimize the weighted number of early and tardy jobs. Bounded version of batch scheduling is discussed here and all jobs share a common due window. When the early and tardy penalty coefficients depend on the jobs and the due window location is a decision variable, the problem is proved to be strongly NP-Complete and several optimal properties are proposed. Then several special cases are solved.
Keywords
computational complexity; minimisation; scheduling; NP-complete; batch scheduling; bounded batch; decision variable; early jobs; early penalty coefficients; tardy jobs; tardy penalty coefficients; weighted number minimization; window location; Europe; batch; due window; early; scheduling; tardy;
fLanguage
English
Publisher
ieee
Conference_Titel
Biomedical Engineering and Informatics (BMEI), 2010 3rd International Conference on
Conference_Location
Yantai
Print_ISBN
978-1-4244-6495-1
Type
conf
DOI
10.1109/BMEI.2010.5639626
Filename
5639626
Link To Document