The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost

Dvir Shabtay

European Journal of Operational Research, 2014, vol. 233, issue 1, 64-74

Abstract: We study a scheduling problem with rejection on a single serial batching machine, where the objectives are to minimize the total completion time and the total rejection cost. We consider four different problem variations. The first is to minimize the sum of the two objectives. The second and the third are to minimize one objective, given an upper bound on the value of the other objective and the last is to find a Pareto-optimal solution for each Pareto-optimal point. We provide a polynomial time procedure to solve the first variation and show that the three other variations are NP-hard. For solving the three NP-hard problems, we construct a pseudo-polynomial time algorithm. Finally, for one of the NP-hard variants of the problem we propose an FPTAS, provided some conditions hold.

Keywords: Batch scheduling; Bicriteria scheduling; Rejection; Total completion time (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (15)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221713006784
Full text for ScienceDirect subscribers only

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:eee:ejores:v:233:y:2014:i:1:p:64-74

DOI: 10.1016/j.ejor.2013.08.013

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().