×

A bicriteria approach for single machine scheduling with resource allocation, learning effect and a deteriorating maintenance activity. (English) Zbl 1377.90032

Summary: This paper considers the single machine scheduling with learning effect, resource allocation and deteriorating maintenance activity simultaneously. For the convex resource allocation consumption function, we provide a bicriteria analysis where the first (schedule) criterion is to minimize the total weighted sum of makespan, total completion time and total absolute differences in completion times, and the second (resource) criterion is to minimize the total weighted resource consumption. Our aim is to find the optimal resource allocations and job sequence that minimize the three different models of considering the two criterion. We show that these three models are polynomially solvable respectively.

MSC:

90B35 Deterministic scheduling theory in operations research
90B25 Reliability, availability, maintenance, inspection in operations research
Full Text: DOI

References:

[1] Biskup, D (2008). A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research, 188, 315-329. · Zbl 1129.90022
[2] Cheng, TCE, Yang, S-J and Yang, D-L (2012). Common due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity. International Journal of Production Economics, 135, 154-161.
[3] Hardy, GH, Littlewood, JE and Polya, G (1967). Inequalities. Cambridge: Cambridge University Press.
[4] He, H-Y, Liu, M and Wang, J-B (2016). Resource constrained scheduling with general truncated job-dependent learning effect. Journal of Combinatorial Optimization, doi: 10.1007/s10878-015-9984-5. · Zbl 1362.90192
[5] Hsu, C-J, Ji, M, Guo, J-Y and Yang, D-L (2013). Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities. Information Sciences, 253, 163-169. · Zbl 1321.90056
[6] Ji, P, Li, G, Huo, Y and Wang, J-B (2014). Single-machine common flow allowance scheduling with job-dependent aging effects and a deteriorating maintenance activity. Optimization Letters, 8, 1389-1400. · Zbl 1292.90131
[7] Ji, M, Tang, X, Zhang, X and Cheng, TCE (2016). Machine scheduling with deteriorating jobs and DeJong’s learning effect. Computers & Industrial Engineering, 91, 42-47.
[8] Kubzin, MA and Strusevich, VA (2006). Planning machine maintenance in two-machine shop scheduling. Operations Research, 54, 789-800. · Zbl 1167.90669
[9] Li, G, Luo, M-L, Zhang, W-J and Wang, X-Y (2015a). Single-machine due-window assignment scheduling based on common flow allowance, learning effect and resource allocation. International Journal of Production Research, 53(4), 1228-1241.
[10] Li, X-J, Wang, J-J and Wang, X-R (2015b). Single-machine scheduling with learning effect, deteriorating jobs and convex resource dependent processing times. Asia-Pacific Journal of Operational Research, 32(3), 1550033. · Zbl 1330.90032
[11] Liu, C-L and Wang, J-J (2016). Unrelated parallel-machine scheduling with controllable processing times and impact of deteriorating maintenance activities under consideration. Asia-Pacific Journal of Operational Research, 33(1), 1650001. · Zbl 1338.90173
[12] Liu, L, Wang, J-J and Wang, X-Y (2016). Due-window assignment scheduling with resource processing times to minimise total resource consumption cost. International Journal of Production Research, 54, 1186-1195.
[13] Lu, Y-Y, Li, G, Wu, Y-B and Ji, P (2014). Optimal due-date assignment problem with learning effect and resource-dependent processing times. Optimization Letters, 8, 113-127. · Zbl 1288.90034
[14] Lu, Y-Y, Teng, F and Feng, Z-X (2015). Scheduling jobs with truncated exponential sum-of-logarithm-processing-times based and position-based learning effects. Asia-Pacific Journal of Operational Research, 32(3), 1550026. · Zbl 1325.90047
[15] Ma, Y, Chu, C and Zuo, C (2010). A survey of scheduling with deterministic machine availability constraints. Computers and Industrial Engineering, 58, 199-211.
[16] Mor, B and Mosheiov, G (2014). Batch scheduling of identical jobs with controllable processing times. Computers & Operations Research, 41, 115-124. · Zbl 1348.90291
[17] Mor, B and Mosheiov, G (2015). Scheduling a deteriorating maintenance activity and due-window assignment. Computers & Operations Research, 57, 33-40. · Zbl 1348.90292
[18] Mosheiov, G and Sidney, JB (2003). Scheduling with general job-dependent learning curves. European Journal of Operational Research, 147, 665-670. · Zbl 1037.90529
[19] Mosheiov, G and Sidney, JB (2010). Scheduling a deteriorating maintenance activity on a single machine. Journal of Operational Research Society, 61, 882-887. · Zbl 1193.90106
[20] Shabtay, D and Steiner, G (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics155(13), 1643-1666. · Zbl 1119.90022
[21] Shabtay, D and Steiner, G (2011). A bicriteria approach to minimize the total weigted number of tardy jobs with convex controllable processing times and assignable due dates. Journal of Scheduling, 14, 455-469. · Zbl 1280.90071
[22] Shiau, Y-R, Tsai, M-S, Lee, W-C and Cheng, TCE (2015). Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time. Computers & Industrial Engineering, 87, 580-589.
[23] Wang, J-B, Liu, F and Wang, J-J (2016). Research on \(m\)-machine flow shop scheduling with truncated learning effects. International Transactions in Operational Research, doi: 10.1111/itor.12323. · Zbl 07766344
[24] Wang, J-B, Liu, M, Yin, N and Ji, P (2017). Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects. Journal of Industrial and Management Optimization, 13(2), 1025-1039. · Zbl 1364.90166
[25] Wang, J-B and Wang, M-Z (2014). Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times. Asia-Pacific Journal of Operational Research, 31(5), 1450036. · Zbl 1299.90167
[26] Wang, J-B and Wang, J-J (2015). Research on scheduling with job-dependent learning effect and convex resource dependent processing times. International Journal of Production Research, 53, 5826-5836.
[27] Wang, J-J, Wang, J-B and Liu, F (2011). Parallel machines scheduling with a deteriorating maintenance activity. Journal of the Operational Research Society, 62, 1898-1902.
[28] Wang, D, Wang, M-Z and Wang, J-B (2010). Single-machine scheduling with learning effect and resource-dependent processing times. Computers & Industrial Engineering, 59, 458-462.
[29] Wang, J-B and Wei, C-M (2011). Parallel machines scheduling with a deteriorating maintenance activity and total absolute differences penalties. Applied Mathematics and Computation, 217, 8093-8099. · Zbl 1230.90103
[30] Wang, J-J and Zhang, B-H (2015). Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects. Computers & Operations Research, 58, 24-31. · Zbl 1348.90322
[31] Xu, J, Wu, C.-C, Yin, Y, Zhao, C, Chiou, Y-T and Lin, W-C (2016). An order scheduling problem with position-based learning effect. Computers & Operations Research, 74, 175-186. · Zbl 1349.90421
[32] Yang, D-L, Lai, C-J and Yang, S-J (2014). Scheduling problems with multiple due windows assignment and controllable processing times on a single machine. International Journal of Production Economics, 150, 96-103.
[33] Zhu, Z, Sun, L, Chu, F and Liu, M (2011). Single-machine group scheduling with resource allocation and learning effect. Computers & Industrial Engineering, 60, 148-157.
[34] Zhu, Z, Chu, F, Sun, L and Liu, M (2013). Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity. Applied Mathematical Modelling, 37, 5371-5380. · Zbl 1426.90148
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.