On scheduling unbounded batch processing machine(s)

Research output: Journal article publicationJournal articleAcademic researchpeer-review

2 Citations (Scopus)

Abstract

The computational complexity of scheduling jobs with released dates on an unbounded batch processing machine to minimize total completion time and on parallel unbounded batch processing machines to minimize total weighted completion time remains open. In this note we show that the first problem is NP-hard with respect to id-encoding, and the second one is strongly NP-hard.
Original languageEnglish
Pages (from-to)814-817
Number of pages4
JournalComputers and Industrial Engineering
Volume58
Issue number4
DOIs
Publication statusPublished - 1 May 2010

Keywords

  • Batch processing
  • Computational complexity
  • Scheduling

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this