Single machine parallel batch scheduling subject to precedence constraints

Edwin Tai Chiu Cheng, Chi To Ng, J. J. Yuan, Z. H. Liu

Research output: Journal article publicationJournal articleAcademic researchpeer-review

16 Citations (Scopus)

Abstract

We consider the single machine parallel batch scheduling problems to minimize makespan and total completion time, respectively, under precedence relations. The complexities of these two problems are reported as open in the literature. In this paper, we settle these open questions by showing that both problems are strongly NP-hard, even when the precedence relations are chains. When the processing times of jobs are directly agreeable or inversely agreeable with the precedence relations, there is an O(n2) time algorithm to minimize the makespan.
Original languageEnglish
Pages (from-to)949-958
Number of pages10
JournalNaval Research Logistics
Volume51
Issue number7
DOIs
Publication statusPublished - 1 Oct 2004

Keywords

  • Parallel batching
  • Scheduling
  • Single machine

ASJC Scopus subject areas

  • Modelling and Simulation
  • Ocean Engineering
  • Management Science and Operations Research

Cite this