| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 496054 | Applied Soft Computing | 2013 | 13 Pages |
Abstract
⺠We study a single-machine two-agent scheduling problem to minimize the total weighted earliness. ⺠We derive several dominance properties and a lower bound to speed up for searching an optimal solution. ⺠We develop a branch-and-bound and a simulated annealing algorithm incorporating for the problem.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Yunqiang Yin, Chin-Chia Wu, Wen-Hsiang Wu, Chou-Jung Hsu, Wen-Hung Wu,