×

Scheduling with general job-dependent learning curves. (English) Zbl 1037.90529

Summary: 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.

MSC:

90B35 Deterministic scheduling theory in operations research
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Biskup, D., Single-machine scheduling with learning considerations, European Journal of Operational Research, 115, 173-178 (1999) · Zbl 0946.90025
[2] Badiru, A. B., Computational survey of univariate and multivariate learning curve models, IEEE Transactions on Engineering Management, 39, 176-188 (1992)
[3] Heizer, J.; Render, B., Operations Management (1999), Prentice Hall: Prentice Hall New Jersey
[4] Mosheiov, G., Scheduling problems with learning effect, European Journal of Operational Research, 132, 687-693 (2001) · Zbl 1017.90051
[5] Mosheiov, G., Parallel machine scheduling with learning effect, Journal of the Operational Research Society, 52, 1-5 (2001) · Zbl 1178.90159
[6] Panwalker, S. S.; Smith, M. L.; Seidmann, A., Common due-date assignment to minimize total penalty for the one machine scheduling problem, Operations Research, 30, 391-399 (1982) · Zbl 0481.90042
[7] Wright, T. P., Factors affecting the cost of airplanes, Journal of the Aeronautical Sciences, February (1936)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.