Parallel machine scheduling with machine availability and eligibility constraints

Lu Wen Liao, Gwo Ji Sheen

研究成果: 雜誌貢獻期刊論文同行評審

74 引文 斯高帕斯(Scopus)

摘要

In this paper we consider the problem of scheduling n independent jobs on m identical machines incorporating machine availability and eligibility constraints while minimizing the makespan. Each machine is not continuously available at all times and each job can only be processed on specified machines. A network flow approach is used to formulate this scheduling problem into a series of maximum flow problems. We propose a polynomial time binary search algorithm to either verify the infeasibility of the problem or solve it optimally if a feasible schedule exists.

原文???core.languages.en_GB???
頁(從 - 到)458-467
頁數10
期刊European Journal of Operational Research
184
發行號2
DOIs
出版狀態已出版 - 16 1月 2008

指紋

深入研究「Parallel machine scheduling with machine availability and eligibility constraints」主題。共同形成了獨特的指紋。

引用此