Abstract
Several recent papers focused on the effect of learning on the optimal solution of scheduling problems. We extend the setting studied so far to the case of job-dependent learning curves, that is, we allow the learning in the production process of some jobs to be faster than that of others. Our learning curve approach, which assumes learning takes place as a function of repetition of the production process, is otherwise completely general, and is not based upon any particular model of learning acquisition. We show that in the new, possibly more realistic setting, the problems of makespan and total flow-time minimization on a single machine, a due-date assignment problem and total flow-time minimization on unrelated parallel machines remain polynomially solvable.
| Original language | English |
|---|---|
| Pages (from-to) | 665-670 |
| Number of pages | 6 |
| Journal | European Journal of Operational Research |
| Volume | 147 |
| Issue number | 3 |
| DOIs | |
| State | Published - 16 Jun 2003 |
Bibliographical note
Funding Information:This work was supported in part by the Recanati Fund of the School of Business, The Hebrew University, Jerusalem and by the Natural Sciences and Engineering Research Council of Canada (NSERC) grant number OG0002507.
Keywords
- Learning curves
- Parallel machines
- Scheduling
- Single machine