| Autor: |
Cheng, T.C.E., Chen, Zhi-Long, Li, Chung-Lun, Lin, B.M.-T. |
| Zdroj: |
Naval Research Logistics (Formerly Naval Research Logistics Quarterly); February 1998, Vol. 45 Issue: 1 p67-82, 16p |
| Abstrakt: |
We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 6782, 1998 |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
Plný text