頁籤選單縮合
題 名 | Single-Machine Job Scheduling about a Common Due Date with Arbitrary Earliness/Tardiness Penalties Using a Genetic Algorithm |
---|---|
作 者 | Cha,Chun Nam; Lim,Sanggyu; Jeong,Yong Kyeong; | 書刊名 | Asia Pacific Management Review |
卷 期 | 7:2 2002.06[民91.06] |
頁 次 | 頁239-254 |
分類號 | 494.542 |
關鍵詞 | Common due date; Job sequence; Earliness/tardiness penalty; Genetic algorithm; |
語 文 | 英文(English) |
英文摘要 | We consider the problem of scheduling jobs on a single machine about a common due date. Our objective is to determine the common due date and processing sequence of new jobs together with the re-sequencing of old jobs which minimize the sum of jobs’ earliness/tardiness, completion time penalties and due date related penalty. We drive properties that can be used to find the optimal common due date and processing sequence. Since our problem is NP-hard, we propose a genetic algorithm to solve the problem efficiently. Results from computational study reveal that the genetic algorithm can generate near optimal solutions. |
本系統中英文摘要資訊取自各篇刊載內容。