Scheduling jobs with release dates and deadlines on a batch processing machine

Edwin Tai Chiu Cheng; Z. Liu; W. Yu

doi:10.1023/A:1010991401683

Scheduling jobs with release dates and deadlines on a batch processing machine

Edwin Tai Chiu Cheng, Z. Liu, W. Yu

Research output: Journal article publication › Journal article › Academic research › peer-review

42 Citations (Scopus)

Abstract

In this paper, we investigate the unbounded version of scheduling jobs with release dates and deadlines on a batch processing machine. NP-completeness is established for the case where all jobs have agreeable processing times and deadlines. Polynomial time algorithms are presented for the following cases: agreeable release dates and deadlines; agreeable release dates and processing times; a fixed number of distinct release dates, distinct processing times or distinct deadlines.

Original language	English
Pages (from-to)	685-690
Number of pages	6
Journal	IIE Transactions (Institute of Industrial Engineers)
Volume	33
Issue number	8
DOIs	https://doi.org/10.1023/A:1010991401683
Publication status	Published - 1 Jan 2001

ASJC Scopus subject areas

Industrial and Manufacturing Engineering

More information

10.1023/A:1010991401683

Cite this

@article{930c836e1df34a5ba39ebeaf9e8fa1f7,

title = "Scheduling jobs with release dates and deadlines on a batch processing machine",

abstract = "In this paper, we investigate the unbounded version of scheduling jobs with release dates and deadlines on a batch processing machine. NP-completeness is established for the case where all jobs have agreeable processing times and deadlines. Polynomial time algorithms are presented for the following cases: agreeable release dates and deadlines; agreeable release dates and processing times; a fixed number of distinct release dates, distinct processing times or distinct deadlines.",

author = "Cheng, {Edwin Tai Chiu} and Z. Liu and W. Yu",

year = "2001",

month = jan,

day = "1",

doi = "10.1023/A:1010991401683",

language = "English",

volume = "33",

pages = "685--690",

journal = "IIE Transactions (Institute of Industrial Engineers)",

issn = "0740-817X",

publisher = "Taylor and Francis Ltd.",

number = "8",

}

TY - JOUR

T1 - Scheduling jobs with release dates and deadlines on a batch processing machine

AU - Cheng, Edwin Tai Chiu

AU - Liu, Z.

AU - Yu, W.

PY - 2001/1/1

Y1 - 2001/1/1

N2 - In this paper, we investigate the unbounded version of scheduling jobs with release dates and deadlines on a batch processing machine. NP-completeness is established for the case where all jobs have agreeable processing times and deadlines. Polynomial time algorithms are presented for the following cases: agreeable release dates and deadlines; agreeable release dates and processing times; a fixed number of distinct release dates, distinct processing times or distinct deadlines.

AB - In this paper, we investigate the unbounded version of scheduling jobs with release dates and deadlines on a batch processing machine. NP-completeness is established for the case where all jobs have agreeable processing times and deadlines. Polynomial time algorithms are presented for the following cases: agreeable release dates and deadlines; agreeable release dates and processing times; a fixed number of distinct release dates, distinct processing times or distinct deadlines.

UR - http://www.scopus.com/inward/record.url?scp=0035427205&partnerID=8YFLogxK

U2 - 10.1023/A:1010991401683

DO - 10.1023/A:1010991401683

M3 - Journal article

SN - 0740-817X

VL - 33

SP - 685

EP - 690

JO - IIE Transactions (Institute of Industrial Engineers)

JF - IIE Transactions (Institute of Industrial Engineers)

IS - 8

ER -

Scheduling jobs with release dates and deadlines on a batch processing machine

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this