haku: @author Kim, D. / yhteensä: 14
viite: 5 / 14
| Tekijä: | Ventura, J. A. Kim, D. Garriga, F. |
| Otsikko: | Single machine earliness-tardiness scheduling with resource-dependent release dates |
| Lehti: | European Journal of Operational Research
2002 : OCT, VOL. 142:1, p. 52-69 |
| Asiasana: | SCHEDULING DYNAMIC PROGRAMMING HEURISTIC METHODS ANALYTICAL REVIEW |
| Kieli: | eng |
| Tiivistelmä: | This paper deals with the single machine earliness and tardiness scheduling problem with a common due date and resource-dependent release dates. It is assumed that the cost of resource consumption of a job is a non- increasing linear function of the job release date, and this function is common for all jobs. The objective is to find a schedule and job release dates that minimize the total resource consumption, and earliness and tardiness penalties. It is shown that the problem is NP-hard in the ordinary sense even if the due date is unrestricted (the number of jobs that can be scheduled before the due date is unrestricted). An exact dynamic programming (DP) algorithm for small and medium size problems is developed. |
SCIMA