Abstract
The phenomenon of ‘learning’ has been extensively studied in many different areas of Operational Research. However, the ‘learning effect’ of the producer/processor has rarely been studied in the general context of production scheduling, and has never been investigated in multi-machine scheduling settings. We focus in this paper on flow-time minimization on parallel identical machines. We show that this problem has a polynomial time solution, although the computational effort required is much larger than the effort required for solving the classical version of the problem.
| Original language | English |
|---|---|
| Pages (from-to) | 1165-1169 |
| Number of pages | 5 |
| Journal | Journal of the Operational Research Society |
| Volume | 52 |
| Issue number | 10 |
| DOIs | |
| State | Published - Oct 2001 |
Bibliographical note
Funding Information:Acknowledgements—I would like to thank Prof Yanki Ritov for his very helpful comments. This paper was supported in part by the Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel.
Keywords
- Flow-time
- Learning
- Parallel machines
- Scheduling