The single machine serial batch scheduling problems with rejection
Juan Zou () and
Cuixia Miao
Additional contact information
Juan Zou: Qufu Normal University
Cuixia Miao: Qufu Normal University
Operational Research, 2016, vol. 16, issue 2, No 4, 221 pages
Abstract:
Abstract We consider several serial batch scheduling problems with rejection. Each job is either processed on a single serial batching machine or rejected by paying a penalty. We analyze two models with rejection. The first model is to minimize the sum of the scheduling cost of the accepted jobs and the total penalty of the rejected jobs, where the scheduling costs are the total completion time, the makespan, the maximum lateness and the weighted number of tardy jobs, respectively. For the former two problems, we propose two polynomial time algorithms to solve them. For the last two problems, we derive efficient dynamic programming algorithms. The second model is to minimize the makespan, given an upper bound on the total rejection cost, we present a fully polynomial time approximation scheme.
Keywords: Scheduling; Serial batching; Rejection; Dynamic programming (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://link.springer.com/10.1007/s12351-015-0193-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:operea:v:16:y:2016:i:2:d:10.1007_s12351-015-0193-x
Ordering information: This journal article can be ordered from
https://www.springer ... search/journal/12351
DOI: 10.1007/s12351-015-0193-x
Access Statistics for this article
Operational Research is currently edited by Nikolaos F. Matsatsinis, John Psarras and Constantin Zopounidis
More articles in Operational Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().