摘要
We consider the one-machine scheduling problem with minimum and maximum time lags while minimizing the makespan. This problem typically arises in a manufacturing environment where the next job has to be carried out within a specific time range after the completion of the immediately preceding job. We describe a branch and bound algorithm, based on the input and output of a clique and the relevant propositions, for finding the optimal waiting times. The computational experiments give promising results, showing whether a given instance is feasible or infeasible. With the proposed branch and bound algorithm we can either find an optimal schedule or establish the infeasibility within an acceptable run time.
原文 | ???core.languages.en_GB??? |
---|---|
頁(從 - 到) | 102-116 |
頁數 | 15 |
期刊 | European Journal of Operational Research |
卷 | 181 |
發行號 | 1 |
DOIs | |
出版狀態 | 已出版 - 16 8月 2007 |