| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10347153 | Computers & Operations Research | 2012 | 13 Pages |
Abstract
⺠We study the single machine problem with quadratic earliness and tardiness costs. ⺠The problem, for the first time, is optimally solved for problems up to 30 jobs. ⺠Lower and upper bounds have higher efficiency in comparison with previous studies. ⺠The proposed heuristic method has an overall optimality gap less than 1.3 percent.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
K. Kianfar, G. Moslehi,