Premium
A heuristic for the two‐machine no‐wait openshop scheduling problem
Author(s) -
Sidney Jeffrey B.,
Sriskandarajah Chelliah
Publication year - 1999
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(199903)46:2<129::aid-nav1>3.0.co;2-3
Subject(s) - job shop scheduling , computer science , heuristic , mathematical optimization , scheduling (production processes) , operations research , artificial intelligence , mathematics , routing (electronic design automation) , computer network
In this paper the problem of minimizing makespan in a two‐machine openshop is examined. A heuristic algorithm is proposed, and its worst case performance ratio and complexity are analyzed. The average case performance is evaluated using an empirical study. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 129–145, 1999