Parallel machine scheduling with batch setup times

Research output: Journal article publicationJournal articleAcademic researchpeer-review

23 Citations (Scopus)

Abstract

We consider a problem of scheduling several batches of jobs on two identical parallel machines to minimize the total completion time of jobs. A setup time is incurred whenever there is a switch from processing a job in one batch to a job in another batch. When the number of jobs is arbitrary, the computational complexity of the problem is posed as an open problem in the literature. We show in this note that the problem is binary NP-hard even when the setup times are sequence independent and all processing times are equal.
Original languageEnglish
Pages (from-to)1171-1174
Number of pages4
JournalOperations Research
Volume42
Issue number6
DOIs
Publication statusPublished - 1 Jan 1994

ASJC Scopus subject areas

  • Computer Science Applications
  • Management Science and Operations Research

Cite this