A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs

A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs

0.00 Avg rating0 Votes
Article ID: iaor2008174
Country: United Kingdom
Volume: 6
Issue: 6
Start Page Number: 551
End Page Number: 555
Publication Date: Nov 2003
Journal: Journal of Scheduling
Authors: , ,
Abstract:

We consider the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs. Each job consists of several operations that belong to different families. In a schedule, each family of job operations may be processed in batches with each batch incurring a setup time. A job completes when all of its operations have been processed. The objective is to minimize the number of tardy jobs. In the literature, this problem has been proved to be strongly NP-hard for arbitrary due-dates. We show in this paper that the problem remains strongly NP-hard even when the due-dates are common and all jobs have the same processing time.

Reviews

Required fields are marked *. Your email address will not be published.