IEEE - Institute of Electrical and Electronics Engineers, Inc. - Minimizing Number of Tardy Jobs on a Batch Processing Machine with Incompatible Job Families

2008 ISECS International Colloquium on Computing, Communication, Control, and Management (CCCM)

Author(s): Lili Liu ; Feng Zhang
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 August 2008
Conference Location: Guangzhou, China
Conference Date: 3 August 2008
Volume: 3
Page(s): 277 - 280
ISBN (Paper): 978-0-7695-3290-5
DOI: 10.1109/CCCM.2008.107
Regular:

In this paper we prove that the problem of scheduling jobs with incompatible job families on a single batch processing machine to minimize number of tardy jobs is strongly (unary) NP-hard. We then... View More

Advertisement