By Topic

Minimizing Number of Tardy Jobs on a Batch Processing Machine with Incompatible Job Families

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lili Liu ; Sch. of Sci., Shanghai Second Polytech. Univ., Shanghai ; Feng Zhang

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 develop a dynamic programming algorithm for minimizing weighted number of tardy jobs on a single batch processing machine with incompatible job families.

Published in:

Computing, Communication, Control, and Management, 2008. CCCM '08. ISECS International Colloquium on  (Volume:3 )

Date of Conference:

3-4 Aug. 2008