Scheduling with agreeable release times and due dates on a batch processing machine

Chung-Lun Li; Chung-Yee Lee

doi:10.1016/0377-2217(95)00332-0

Scheduling with agreeable release times and due dates on a batch processing machine

Chung-Lun Li, Chung-Yee Lee

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

101 Citations (Scopus)

Abstract

We consider the problem of scheduling semiconductor burn-in operations, where burn-in ovens are modeled as batch processing machines. The job release times and due dates are assumed to be agreeable. Two different objective functions are considered: minimize the maximum tardiness and minimize the number of tardy jobs. We study the complexity of the problems. Efficient algorithms are also provided for the case when the job release times, due dates, and processing times are agreeable, which generalize those provided by Lee, Uzsoy and Martin-Vega (1992).

Original language	English
Pages (from-to)	564-569
Journal	European Journal of Operational Research
Volume	96
Issue number	3
DOIs	https://doi.org/10.1016/0377-2217(95)00332-0
Publication status	Published - 1 Feb 1997
Externally published	Yes

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Research Keywords

Computational complexity
Dynamic programming
Scheduling

Access Output

10.1016/0377-2217(95)00332-0

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{73942b2586f8424d87fb4d4034b36faa,

title = "Scheduling with agreeable release times and due dates on a batch processing machine",

abstract = "We consider the problem of scheduling semiconductor burn-in operations, where burn-in ovens are modeled as batch processing machines. The job release times and due dates are assumed to be agreeable. Two different objective functions are considered: minimize the maximum tardiness and minimize the number of tardy jobs. We study the complexity of the problems. Efficient algorithms are also provided for the case when the job release times, due dates, and processing times are agreeable, which generalize those provided by Lee, Uzsoy and Martin-Vega (1992).",

keywords = "Computational complexity, Dynamic programming, Scheduling",

author = "Chung-Lun Li and Chung-Yee Lee",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].",

year = "1997",

month = feb,

day = "1",

doi = "10.1016/0377-2217(95)00332-0",

language = "English",

volume = "96",

pages = "564--569",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - Scheduling with agreeable release times and due dates on a batch processing machine

AU - Li, Chung-Lun

AU - Lee, Chung-Yee

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 1997/2/1

Y1 - 1997/2/1

N2 - We consider the problem of scheduling semiconductor burn-in operations, where burn-in ovens are modeled as batch processing machines. The job release times and due dates are assumed to be agreeable. Two different objective functions are considered: minimize the maximum tardiness and minimize the number of tardy jobs. We study the complexity of the problems. Efficient algorithms are also provided for the case when the job release times, due dates, and processing times are agreeable, which generalize those provided by Lee, Uzsoy and Martin-Vega (1992).

AB - We consider the problem of scheduling semiconductor burn-in operations, where burn-in ovens are modeled as batch processing machines. The job release times and due dates are assumed to be agreeable. Two different objective functions are considered: minimize the maximum tardiness and minimize the number of tardy jobs. We study the complexity of the problems. Efficient algorithms are also provided for the case when the job release times, due dates, and processing times are agreeable, which generalize those provided by Lee, Uzsoy and Martin-Vega (1992).

KW - Computational complexity

KW - Dynamic programming

KW - Scheduling

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

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0031077278&origin=recordpage

U2 - 10.1016/0377-2217(95)00332-0

DO - 10.1016/0377-2217(95)00332-0

M3 - RGC 21 - Publication in refereed journal

SN - 0377-2217

VL - 96

SP - 564

EP - 569

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

Scheduling with agreeable release times and due dates on a batch processing machine

Abstract

Bibliographical note

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this