Optimal parallel machines scheduling with machine availability and eligibility constraints

Gwo Ji Sheen, Lu Wen Liao, Cheng Feng Lin

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

18 引文 斯高帕斯(Scopus)

摘要

In reality, the machine might become unavailable due to machine breakdowns or various inevitable reasons, and machine might have different capability to processing job. Motivated by this, we consider the problem of scheduling n non-preemptive and independent jobs on m identical machines incorporating machine availability and eligibility constraints while minimizing the maximum lateness. Each machine is capable of processing at specific availability intervals. We develop a branch and bound algorithm applying several immediate selection rules for solving this scheduling problem.

原文???core.languages.en_GB???
頁(從 - 到)132-139
頁數8
期刊International Journal of Advanced Manufacturing Technology
36
發行號1-2
DOIs
出版狀態已出版 - 2月 2008

指紋

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

引用此