Batch scheduling to minimize the weighted number of tardy jobs

Authors:
Erdal Erel;Jay B. Ghosh
Affiliations:
Faculty of Business Administration, Bilkent University, 06800 Bilkent, Ankara, Turkey;Apratech, LLC, Los Angeles, CA, USA
Venue:
Computers and Industrial Engineering
Year:
2007

Citing 3
Cited 0

Minimizing the number of tardy jobs on a single machine with batch setup times

Acta Cybernetica
Algorithms for Scheduling Independent Tasks

Journal of the ACM (JACM)
Scheduling with batching: minimizing the weighted number of tardy jobs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we address a single-machine scheduling problem with due dates and batch setup times to minimize the weighted number of tardy jobs. We give a pseudo-polynomial dynamic program and a fully-polynomial approximation scheme for the case where the due dates are uniform within a family.