Single machine multiple common due dates scheduling with learning effects. (English) Zbl 1207.90059
Summary: We consider the problem of simultaneous determination of optimal due dates and optimal schedule for the single machine problem with multiple common due dates. The penalty for a job is assumed to be a linear function of the due date and the earliness/tardiness for the job. The objective function is to minimize the total penalty for all jobs. We show that with the introduction of learning to job processing times the problem remains polynomially solvable for a given number of multiple common due dates.
MSC:
| 90B35 | Deterministic scheduling theory in operations research |
References:
| [1] | Badiru, A. B., Computational survey of univariate and multivariate learning curve models, IEEE Transactions on Engineering Management, 39, 176-188 (1992) |
| [2] | Biskup, D., Single-machine scheduling with learning considerations, European Journal of Operational Research, 115, 173-178 (1999) · Zbl 0946.90025 |
| [3] | Mosheiov, G., Scheduling problems with a learning effect, European Journal of Operational Research, 132, 687-693 (2001) · Zbl 1017.90051 |
| [4] | Mosheiov, G., Parallel machine scheduling with a learning effect, Journal of the Operational Research Society, 52, 1165-1169 (2001) · Zbl 1178.90159 |
| [5] | Wang, J. B.; Xia, Z. Q., Flow shop scheduling with a learning effect, Journal of the Operational Research Society, 56, 1325-1330 (2005) · Zbl 1082.90041 |
| [6] | Mosheiov, G.; Sidney, J. B., Scheduling with general job-dependent learning curves, European Journal of Operational Research, 147, 665-670 (2003) · Zbl 1037.90529 |
| [7] | Bachman, A.; Janiak, A., Scheduling jobs with position-dependent processing times, Journal of the Operational Research Society, 55, 257-264 (2004) · Zbl 1095.90033 |
| [8] | Biskup, D., A state-of-the-art review on scheduling with learning effects, European Journal of Operational Research, 118, 315-329 (2008) · Zbl 1129.90022 |
| [9] | Weeks, J. K.; Fryer, J. S., A methodology for assignment minimum cost due dates, Management Sciences, 23, 872-881 (1977) |
| [10] | Weeks, J. K., A simulation study of predictable due dates, Management Sciences, 25, 363-373 (1979) · Zbl 0409.90041 |
| [11] | Baker, K. R.; Bertrand, J., A comparison of due-date selection rules, AIIE Transactions, 13, 123-131 (1981) |
| [12] | 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 |
| [13] | Chand, S.; Chhajed, D., A single machine model for determination of optimal due dates and sequence, Operations Research, 40, 596-602 (1992) · Zbl 0762.90034 |
| [14] | Dickman, B.; Wilamowsky, Y.; Epstein, S., Multiple common due dates, Naval Research Logistics, 48, 293-298 (2001) · Zbl 1054.90030 |
| [15] | Baker, K. R.; Scudder, G. D., Sequencing with earliness and tardiness penalties: a review, Operations Research, 38, 22-36 (1990) · Zbl 0699.90052 |
| [16] | Gordon, V. S.; Proth, J. M.; Chu, C., A survey of the state-of-the-art of common due date assignment and scheduling research, European Journal of Operational Research, 139, 1, 1-25 (2002) · Zbl 1009.90054 |
| [17] | Stirzaker, D., Elementary Probability (1995), Cambridge University Press: Cambridge University Press Cambridge |
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.
