摘要
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 |