ORF  >> Vol. 7 No. 1 (February 2017)

    Single-Machine Due-Window Assignment and Scheduling with Discretely Controllable Job Processing Times and a Deteriorating Rate-Modifying Activity

  • 全文下载: PDF(448KB) HTML   XML   PP.1-9   DOI: 10.12677/ORF.2017.71001  
  • 下载量: 807  浏览量: 2,340  


张 蕾:沈阳师范大学数学与系统科学学院,辽宁 沈阳

排序单机加工时间分别可控退化维修交货期窗口Scheduling Single-Machine Discretely Controllable Job Processing Times Deteriorating Rate-Modifying Activity Due-Window



In this paper, we consider single-machine due-window assignment and scheduling with discretely controllable job processing times and a deteriorating rate-modifying activity. Each job has multiple processing times to be selected and different processing times are associated with different costs. In addition, we can schedule a deteriorating rate-modifying activity in order to reduce the total cost. We consider two versions of the problem, in the first version, all the jobs share a common due-window and in the second version, each job has their own due-window. The objective is to determine the optimal job sequence, schedule the deteriorating rate-modifying activity and the due-window, so as to minimize the total cost. We provide polynomial-time algorithms for the considered problems.

张蕾. 带有退化维修和交货期窗口的加工时间分别可控的单机排序问题[J]. 运筹与模糊学, 2017, 7(1): 1-9. https://doi.org/10.12677/ORF.2017.71001


[1] Mosheiov, G. and Sarig, A. (2009) Scheduling a Maintenance Activity and Due-Window Assignment on a Single Machine. Computers & Operations Research, 36, 2541-2545. https://doi.org/10.1016/j.cor.2008.10.007
[2] Liu, L., Wang, J.J. and Wang, X.Y. (2016) Single Machine Due-Window Assignment Scheduling with Resource- Dependent Processing Times to Minimize Total Resource Consumption Cost. International Journal of Production Research, 54, 1186-1195. https://doi.org/10.1080/00207543.2015.1056323
[3] 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. https://doi.org/10.1016/j.ijpe.2013.12.021
[4] Chen, Z.L., Lu, Q. and Tang, G.C. (1996) Single Machine Scheduling with Discretely Controllable Processing Times. Operations Research Letters, 21, 69-76. https://doi.org/10.1016/S0167-6377(97)00010-2
[5] Li, J., Li, X. and Luo, W.C. (2016) Single-Machine Scheduling with Discretely Controllable Job Processing Times Subject to a Deteriorating Rate-Modifying Activity. American Journal of Mathematical and Management Science, 35, 194-206. https://doi.org/10.1080/01966324.2016.1149126
[6] Liman, S.D., Panwalkar, S.S. and Thongmee, S. (1998) Common Due Window Size and Location Determination in a Single Machine Scheduling Problem. Journal of the Operational Research Society, 49, 1007-1010. https://doi.org/10.1057/palgrave.jors.2600601
[7] Mosheiov, G. and Oron, D. (2010) Job-Dependent Due-Window Assignment Based on a Common Flow Allowance. Foundations of Computing and Decision Sciences, 35, 185-195.
[8] Mor, B. and Mosheiov, G. (2015) Scheduling a Deteriorating Maintenance Activity and Due-Window Assignment. Computers & Operations Research, 57, 33-40. https://doi.org/10.1016/j.cor.2014.11.016
[9] Wu, Y.B., Wan, L. and Wang, X.Y. (2015) Study on Due-Window Assignment Scheduling Based on Common Flow Allowance. International Journal of Production Economics, 165, 155-157. https://doi.org/10.1016/j.ijpe.2015.04.005