完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Lee, Wen-Chiung | en_US |
dc.contributor.author | Shiau, Yau-Ren | en_US |
dc.contributor.author | Chung, Yu-Hsiang | en_US |
dc.contributor.author | Ding, Lawson | en_US |
dc.date.accessioned | 2014-12-08T15:34:35Z | - |
dc.date.available | 2014-12-08T15:34:35Z | - |
dc.date.issued | 2014 | en_US |
dc.identifier.issn | 1537-744X | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/23613 | - |
dc.identifier.uri | http://dx.doi.org/10.1155/2014/596306 | en_US |
dc.description.abstract | We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-and-bound algorithm is developed to derive the optimal sequence and two simulated annealing heuristic algorithms are proposed to search for the near-optimal solutions. Computational experiments are also conducted to evaluate the proposed branch-and-bound and simulated annealing algorithms. | en_US |
dc.language.iso | en_US | en_US |
dc.title | Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1155/2014/596306 | en_US |
dc.identifier.journal | SCIENTIFIC WORLD JOURNAL | en_US |
dc.contributor.department | 工業工程與管理學系 | zh_TW |
dc.contributor.department | Department of Industrial Engineering and Management | en_US |
dc.identifier.wosnumber | WOS:000330655800001 | - |
dc.citation.woscount | 0 | - |
顯示於類別: | 期刊論文 |