| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 7541323 | Computers & Industrial Engineering | 2018 | 22 Pages |
Abstract
We propose new models of position-dependent processing times for single-machine group scheduling problems. The two objectives of the scheduling problems are to minimize the makespan and the total completion time, respectively. We present polynomial-time algorithms to solve the problems.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Industrial and Manufacturing Engineering
Authors
Xin Zhang, Lijuan Liao, Wenya Zhang, T.C.E. Cheng, Yuanyuan Tan, Min Ji,