A dynamical ant colony optimization with heuristics for scheduling jobs on a single machine with a common due date

Zne Jung Lee*, Shih Wei Lin, Kuo Ching Ying

*此作品的通信作者

研究成果: 圖書/報告稿件的類型章節同行評審

2 引文 斯高帕斯(Scopus)

摘要

The problem of scheduling jobs on a single machine with a common due date is one of NP-complete problems. It is to minimize the total earliness and tardiness penalties. This chapter introduces a Dynamical Ant Colony Optimization (DACO) with heuristics for scheduling jobs on a single machine with a common due date. In the proposed algorithm, the parameter of heuristic information is dynamically adjusted. Furthermore, additional heuristics are embedded into DACO as local search to escape from local optima. Compared with other existing approaches in the literature, the proposed algorithm is very useful for scheduling jobs on a single machine with a common due date.

原文英語
主出版物標題Metaheuristics for Scheduling in Industrial and Manufacturing Applications
編輯Fatos Xhafa, Ajith Abraham
頁面91-103
頁數13
DOIs
出版狀態已出版 - 2008
對外發佈

出版系列

名字Studies in Computational Intelligence
128
ISSN(列印)1860-949X

指紋

深入研究「A dynamical ant colony optimization with heuristics for scheduling jobs on a single machine with a common due date」主題。共同形成了獨特的指紋。

引用此