A general lower bound for the makespan problem

Research output: Contribution to journalArticlepeer-review

13 Scopus citations

Abstract

The problem of scheduling jobs on identical parallel processors to minimize makespan is NP-hard. We introduce a general lower bound which includes as special cases bounds that either dominate, or are equivalent to, lower bounds previously proposed in the literature. The general lower bound unifies earlier results and can be used to identify new bounds, improve previously proposed bounds, and extend bounds for the problem with identical processor ready times to the problem with variable processor ready times.

Original languageEnglish (US)
Pages (from-to)516-524
Number of pages9
JournalEuropean Journal of Operational Research
Volume89
Issue number3
DOIs
StatePublished - Mar 22 1996
Externally publishedYes

Keywords

  • Deterministic
  • Parallel shop
  • Scheduling theory

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Fingerprint Dive into the research topics of 'A general lower bound for the makespan problem'. Together they form a unique fingerprint.

Cite this