zbMATH — the first resource for mathematics

A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration. (English) Zbl 1192.90076
Summary: This paper addresses the integration of two emerging classes of scheduling problems which, for the most part, have evolved independently. These problem classes are (i) scheduling problems with time-dependent processing times and (ii) scheduling problems with rate-modifying activities (RMAs). The integration of these two concepts is motivated by human operators who experience fatigue while carrying out tasks and take rest breaks for recovery, but is also applicable to machines that experience performance degradation over time and require maintenance in order to sustain acceptable production rates. We explore a sequence-independent, single processor makespan problem with position-dependent processing times and prove that under certain conditions, the optimal policy is to schedule the RMA in the middle of the task sequence.

90B35 Deterministic scheduling theory in operations research
Full Text: DOI
[1] Alidaee, B.; Ahmadian, A., Scheduling on a single processor with variable speed, Information processing letters, 60, 189-193, (1996) · Zbl 0900.68041
[2] Alidaee, B.; Womer, N., Scheduling with time dependent processing times: review and extensions, Journal of the operational research society, 50, 7, 711-721, (1999) · Zbl 1054.90542
[3] Biskup, D., A state-of-the-art review on scheduling with learning effects, European journal of operational research, 188, 315-329, (2008) · Zbl 1129.90022
[4] Cheng, Y.; Sun, S., Scheduling linear deteriorating jobs with rejection on a single machine, European journal of operational research, 194, 1, 18-27, (2009) · Zbl 1179.90132
[5] Cheng, T.; Ding, Q.; Lin, B., A concise survey of scheduling with time-dependent processing times, European journal of operational research, 152, 1-13, (2004) · Zbl 1030.90023
[6] Eilon, S., On a mechanistic approach to fatigue and rest periods, International journal of production research, 3, 327-332, (1964)
[7] Gawiejnowicz, S., A note on scheduling on a single processor with speed dependent on a number of executed jobs, Information processing letters, 57, 297-300, (1996) · Zbl 0875.68080
[8] Gordon, V.S.; Tarasevich, A.A., A note: common due date assignment for a single machine scheduling with the rate-modifying activity, Computers and operations research, 36, 2, 325-328, (2009) · Zbl 1163.90488
[9] Gordon, V.; Potts, C.; Strusevich, V.; Whitehead, J., Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation, Journal of scheduling, 1, 357-370, (2008) · Zbl 1168.90441
[10] He, Y.; Ji, M.; Cheng, T., Single machine scheduling with a restricted rate-modifying activity, Naval research logistics, 52, 361-369, (2005) · Zbl 1090.90084
[11] Lee, C.-Y.; Leon, V., Machine scheduling with a rate-modifying activity, European journal of operational research, 128, 119-128, (2001) · Zbl 0983.90020
[12] Lee, C.-Y.; Lin, C.-S., Single-machine scheduling with maintenance and repair rate-modifying activities, European journal of operational research, 135, 493-513, (2001) · Zbl 0989.90036
[13] Lodree, E.J.; Geiger, C.D.; Jiang, X., Taxonomy for integrating scheduling theory and human factors: review and research opportunities, International journal of industrial ergonomics, 39, 1, 39-51, (2009)
[14] Morray, N.; Dessouky, M.; Kijowski, M.; Adapathya, R., Strategic behavior, workload, and performance in task scheduling, Human factors, 33, 5, 607-629, (1991)
[15] Mosheiov, G.; Oron, D., Due-date assignment and maintenance activity scheduling problem, Mathematical and computer modelling, 44, 1053-1057, (2006) · Zbl 1161.90397
[16] Mosheiov, G.; Sidney, J.B., New results on sequencing with rate modification, Infor, 41, 2, 155-163, (2003)
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.