On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times

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

Research output: Journal article publicationJournal articleAcademic researchpeer-review

23 Citations (Scopus)

Abstract

We consider the single machine, serial batching, total completion time scheduling problem with precedence constraints, release dates and identical processing times in this paper. The complexity of this problem is reported as open in the literature. We provide an O(n5) time algorithm to solve this problem.
Original languageEnglish
Pages (from-to)323-326
Number of pages4
JournalOperations Research Letters
Volume31
Issue number4
DOIs
Publication statusPublished - 1 Jul 2003

Keywords

  • Batches
  • Precedence constraints
  • Scheduling

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Cite this