The customer order lead-time problem on parallel machines

James D. Blocher; Dilip Chhajed

doi:10.1002/(SICI)1520-6750(199608)43:5<629::AID-NAV3>3.0.CO;2-7

The customer order lead-time problem on parallel machines

James D. Blocher, Dilip Chhajed

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English (US)
Pages (from-to)	629-654
Number of pages	26
Journal	Naval Research Logistics
Volume	43
Issue number	5
DOIs	https://doi.org/10.1002/(SICI)1520-6750(199608)43:5<629::AID-NAV3>3.0.CO;2-7
State	Published - Aug 1996

ASJC Scopus subject areas

Modeling and Simulation
Ocean Engineering
Management Science and Operations Research

Online availability

10.1002/(SICI)1520-6750(199608)43:5<629::AID-NAV3>3.0.CO;2-7

Library availability

Discover UIUC Full Text

Cite this

@article{71996009441540c0ba5f113f4d15cb76,

title = "The customer order lead-time problem on parallel machines",

abstract = "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.",

author = "Blocher, {James D.} and Dilip Chhajed",

year = "1996",

month = aug,

doi = "10.1002/(SICI)1520-6750(199608)43:5<629::AID-NAV3>3.0.CO;2-7",

language = "English (US)",

volume = "43",

pages = "629--654",

journal = "Naval Research Logistics",

issn = "0894-069X",

publisher = "John Wiley & Sons, Ltd.",

number = "5",

}

TY - JOUR

T1 - The customer order lead-time problem on parallel machines

AU - Blocher, James D.

AU - Chhajed, Dilip

PY - 1996/8

Y1 - 1996/8

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0030214445&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030214445&partnerID=8YFLogxK

U2 - 10.1002/(SICI)1520-6750(199608)43:5<629::AID-NAV3>3.0.CO;2-7

DO - 10.1002/(SICI)1520-6750(199608)43:5<629::AID-NAV3>3.0.CO;2-7

M3 - Article

AN - SCOPUS:0030214445

SN - 0894-069X

VL - 43

SP - 629

EP - 654

JO - Naval Research Logistics

JF - Naval Research Logistics

IS - 5

ER -

The customer order lead-time problem on parallel machines

Abstract

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this