Abstract
This article studies scheduling problems with past-sequence-dependent delivery times (denoted by psddt) on a single-machine, i.e., the delivery time of a job depends on its waiting time of processing. We prove that the total (discounted) weighted completion time minimization can be solved in \(O(n\log n)\) time, where n is the number of jobs, and the weight is a position-dependent weight. For common (denoted by con) and slack (denoted by slk) due-date assignment and position-dependent weights (denoted by pdw), we prove that an objective cost minimization is solvable in \(O(n\log n)\) time. The model (i.e., psddt and pdw) can also be extended to position-dependent (time-dependent) processing times.
Similar content being viewed by others
References
Biskup D (1999) Single-machine scheduling with learning considerations. Eur J Oper Res 115:173–178
Brucker P (2001) Scheduling algorithms, 3rd edn. Springer, Berlin
Cheng TCE, Wu C-C, Chen J-C, Wu W-H, Cheng S-R (2013) Two-machine flowshop scheduling with a truncated learning function to minimize the makespan. Int J Prod Econ 141:79–86
Gawiejnowicz S (2008) Time-dependent scheduling. Springer, Berlin
Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287–326
Hall NG, Posner ME (1991) Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date. Oper Res 39:836–846
Hardy GH, Littlewood JE, Polya G (1967) Inequalities, 2nd edn. Cambridge University Press, Cambridge
Jiang C, Zou D, Bai D, Wang J-B (2020) Proportionate flowshop scheduling with position-dependent weights. Eng Optim 52(1):37–52
Kahlbacher H (1992) Termin-und Ablaufplanung-ein analytischer Zugang. Ph.D. thesis, University of Kaiserslautern
Koulamas C, Kyparisis GJ (2010) Single-machine scheduling problems with past-sequence-dependent delivery times. Int J Prod Econ 126:264–266
Li L, Yan P, Ji P, Wang J-B (2018) Scheduling jobs with simultaneous considerations of controllable processing times and learning effect. Neural Comput Appl 29:1155–1162
Liu M (2013) Parallel-machine scheduling with past-sequence-dependent delivery times and learning effect. Appl Math Model 37:9630–9633
Liu W, Jiang C (2020) Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation. Eng Optim 52(1):74–89
Liu M, Zheng F, Chu C, Xu Y (2012a) New results on single-machine scheduling with past-sequence-dependent delivery times. Theor Comput Sci 438:55–61
Liu M, Zheng F, Chu C, Xu Y (2012b) Single-machine scheduling with past-sequence-dependent delivery times and release times. Inf Process Lett 112:835–838
Liu M, Wang S, Chu, (2013) Scheduling deteriorating jobs with past-sequence-dependent delivery times. Int J Prod Econ 144:418–421
Liu W, Hu X, Wang X-Y (2017) Single machine scheduling with slack due dates assignment. Eng Optim 49:709–717
Lu Y-Y (2016) Research on no-idle permutation flowshop scheduling with time-dependent learning effect and deteriorating jobs. Appl Math Model 40:3447–3450
Lu Y-Y, Liu J-Y (2018) A note on resource allocation scheduling with position-dependent workloads. Eng Optim 50:1810–1827
Lu Y-Y, Teng F, Feng Z-X (2015) Scheduling jobs with truncated exponential sum-of-logarithm-processing-times based and position-based learning effects. Asia Pac J Oper Res 32:1550026
Lu Y-Y, Jin J, Ji P, Wang J-B (2016) Resource-dependent scheduling with deteriorating jobs and learning effects on unrelated parallel machine. Neural Comput Appl 27:1993–2000
Mosheiov G (2011) Proportionate flowshops with general position-dependent processing times. Inf Process Lett 111:174–177
Mosheiov G, Sidney JB (2003) Scheduling with general job-dependent learning curves. Eur J Oper Res 147:665–670
Wang J-J, Zhang B-H (2015) Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects. Comput Oper Res 58:24–31
Wang J-B, Ji P, Cheng TCE, Wang D (2012a) Minimizing makespan in a two-machine flow shop with effects of deterioration and learning. Optim Lett 6:1393–1409
Wang J-B, Wang M-Z, Ji P (2012b) Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs. Int J Syst Sci 43:861–868
Wang X-R, Jin J, Wang J-B, Ji P (2014) Single machine scheduling with truncated job-dependent learning effect. Optim Lett 8:669–677
Wang J-B, Liu F, Wang J-J (2019) Research on \(m\)-machine flow shop scheduling with truncated learning effects. Int Trans Oper Res 26(3):1135–1151
Wang J-B, Gao M, Wang J-J, Liu L, He H (2020) Scheduling with a position-weighted learning effect and job release dates. Eng Optim 52(9):1475–1493
Wu Y-B, Wang J-J (2016) Single-machine scheduling with truncated sum-of-processing-times-based learning effect including proportional delivery times. Neural Comput Appl 27:937–943
Yang S-J, Yang D-L (2012) Single-machine scheduling problems with past-sequence-dependent delivery times and position-dependent processing times. J Oper Res Soc 63:1508–1515
Yin Y, Cheng TCE, Xu J, Cheng S-R, Wu C-C (2013) Single-machine scheduling with past-sequence-dependent delivery times and a linear deterioration. J Ind Manag Optim 9:323–339
Zhao C, Tang H (2014) Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times. J Appl Math Comput 45:259–274
Acknowledgements
This work was supported by the Natural Science Foundation of Liaoning Province, China (2020-MS-233).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Wang, JB., Cui, B., Ji, P. et al. Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times. J Comb Optim 41, 290–303 (2021). https://doi.org/10.1007/s10878-020-00676-z
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-020-00676-z