Journal
INFORMATION PROCESSING LETTERS
Volume 114, Issue 12, Pages 692-695Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ipl.2014.06.009
Keywords
Scheduling; Serial batch; Parallel machine; Total completion time; Rejection; Polynomial time algorithm
Categories
Funding
- National Natural Science Foundation of China [61340045, 11201259]
- Specialized Research Fund for the Doctoral Program of Higher Education of China [20123705110003]
- Innovation Project of Shangdong Graduate Education [SDYC13036]
Ask authors/readers for more resources
We consider two scheduling problems on in uniform serial batch machines where m is fixed. In the first problem, all jobs have to be scheduled and the objective is to minimize total completion time. In the second problem, each job may be either rejected or accepted to be scheduled and the objective is to minimize the sum of total completion time and total rejection penalty. A polynomial time procedure is presented to solve both problems with the time complexity O (m(2)n(m+2)) and O (m(2)n(m+5)), respectively. (C) 2014 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available