| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 496050 | Applied Soft Computing | 2013 | 9 Pages |
Abstract
⺠We address a single-machine scheduling problem with two-agent and different ready times. ⺠We show that the proposed problem is strongly NP-hard. ⺠We develop some dominance rules and lower bounds to be used in a branch-and-bound algorithm. ⺠We propose an ant colony, and four genetic algorithms for near-optimal solution.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Chin-Chia Wu, Wen-Hung Wu, Juei-Chao Chen, Yunqiang Yin, Wen-Hsiang Wu,