Single machine scheduling with release dates and rejection

In this paper, we consider the single machine scheduling problem with release dates and rejection. A job is either rejected, in which case a rejection penalty has to be paid, or accepted and processed on the machine. The objective is to minimize the sum of the makespan of the accepted jobs and the t...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 198; no. 3; pp. 975 - 978
Main Authors:	Zhang, Liqi, Lu, Lingfa, Yuan, Jinjiang
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.11.2009 Elsevier Elsevier Sequoia S.A
Series:	European Journal of Operational Research
Subjects:	Algorithms Applied sciences Approximation Exact sciences and technology Fully polynomial-time approximation scheme Inventory control, production control. Distribution Job shops Operational research and scientific management Operational research. Management science Production scheduling Rejection penalty Release dates Scheduling Scheduling Rejection penalty Fully polynomial-time approximation scheme Scheduling, sequencing Studies Fully polynomial-time approximation scheme Scheduling Rejection penalty Rejection scheme Polynomial approximation NP hard problem Makespan Polynomial method Approximation algorithm Fully polynomial-time approximation Single machine Polynomial time
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!