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

Research output: Journal article publicationJournal articleAcademic researchpeer-review

3 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)551-555
Number of pages5
JournalJournal of Scheduling
Volume6
Issue number6
DOIs
Publication statusPublished - 1 Nov 2003

Keywords

  • Computational complexity
  • Multi-operation jobs
  • Scheduling
  • Single machine

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Management Science and Operations Research

Cite this