This study addresses the identical parallel machine scheduling problem in which makespan are minimized subject to minimize TADC, denoted as P||TADC/ΣCmax . An optimal algorithm is first proposed to solve TADC on identical parallel machine, then a binary integer programming model is developed to minimize makespan. Computational Experiments are conducted and the computation results are reported.
為了持續優化網站功能與使用者體驗,本網站將Cookies分析技術用於網站營運、分析和個人化服務之目的。
若您繼續瀏覽本網站,即表示您同意本網站使用Cookies。