The customer order lead-time problem on parallel machines

James D. Blocher, Dilip Chhajed

Research output: Contribution to journalArticlepeer-review


We consider the problem of scheduling customer orders, each consisting of one or more individual jobs, on a set of parallel processors with the objective of minimizing average order completion time. We provide simple intuitive heuristics to guide managers in this environment and introduce lower bounds that show that these heuristics are effective for a wide variety of problems.

Original languageEnglish (US)
Pages (from-to)629-654
Number of pages26
JournalNaval Research Logistics
Issue number5
StatePublished - Aug 1996

ASJC Scopus subject areas

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


Dive into the research topics of 'The customer order lead-time problem on parallel machines'. Together they form a unique fingerprint.

Cite this