Improved algorithms for single machine scheduling with release dates and rejections

Authors

Cheng He, Henan University of Technology
Joseph Y.T. Leung, Department of Computer Science
Kangbok Lee, York College CUNY
Michael L. Pinedo, Leonard N. Stern School of Business

Document Type

Article

Publication Date

3-1-2016

Abstract

We consider bi-criteria scheduling problems on a single machine with release dates and rejections and both the makespan and the total rejection cost have to be minimized. We consider three scenarios: (1) minimize the sum of the two objectives: makespan and total rejection cost, (2) minimize the makespan subject to a bound on the total rejection cost and (3) minimize the total rejection cost subject to a bound on the makespan. We summarize the results obtained in the literature and provide for several cases improved approximation algorithms and FPTASs.

Identifier

84959132028 (Scopus)

Publication Title

4or

External Full Text Location

https://doi.org/10.1007/s10288-016-0303-5

e-ISSN

16142411

ISSN

16194500

First Page

41

Last Page

55

Issue

1

Volume

14

Grant

TRADA-46-477

Fund Ref

City University of New York

Recommended Citation

He, Cheng; Leung, Joseph Y.T.; Lee, Kangbok; and Pinedo, Michael L., "Improved algorithms for single machine scheduling with release dates and rejections" (2016). Faculty Publications. 10663.
https://digitalcommons.njit.edu/fac_pubs/10663