Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries

George Steiner () and Rui Zhang ()

Annals of Operations Research, 2011, vol. 191, issue 1, 181 pages

Abstract: We study a supply chain scheduling problem, where a common due date is assigned to all jobs and the number of jobs in delivery batches is constrained by the batch size. Our goal is to minimize the sum of the weighted number of tardy jobs, the due-date-assignment costs and the batch-delivery costs. We show that some well-known $\mathcal{NP}$ -hard problems reduce to our problem. Then we propose a pseudo-polynomial algorithm for the problem, establishing that it is $\mathcal{NP}$ -hard only in the ordinary sense. Finally, we convert the algorithm into an efficient fully polynomial time approximation scheme. Copyright Springer Science+Business Media, LLC 2011

Keywords: Scheduling; Due date assignment; Batching; Number of tardy jobs (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-011-1000-6 (text/html)
Access to full text is restricted to subscribers.

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:annopr:v:191:y:2011:i:1:p:171-181:10.1007/s10479-011-1000-6

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-011-1000-6

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().