Premium
The customer order lead‐time problem on parallel machines
Author(s) -
Blocher James D.,
Chhajed Dilip
Publication year - 1996
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/(sici)1520-6750(199608)43:5<629::aid-nav3>3.0.co;2-7
Subject(s) - heuristics , computer science , mathematical optimization , scheduling (production processes) , simple (philosophy) , job shop scheduling , set (abstract data type) , variety (cybernetics) , order (exchange) , lead time , operations research , artificial intelligence , operations management , mathematics , engineering , routing (electronic design automation) , finance , computer network , philosophy , epistemology , economics , programming language , operating system
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. © 1996 John Wiley & Sons, Inc.