Common due date assignment and cumulative deterioration scheduling on a single machine

References

• Ahmadizar, F., and J. Eteghadipour. Forthcoming. “Single-Machine Earliness–Tardiness Scheduling with Two Competing Agents and Idle Time.” Engineering Optimization. doi: 10.1080/0305215X.2016.1190353.
   Google Scholar
• Biskup, D. 2008. “A State-of-the-Art Review on Scheduling with Learning Effects.” European Journal of Operational Research 188 (2): 315–329. doi: 10.1016/j.ejor.2007.05.040
   Web of Science ®Google Scholar
• Brucker, P. 2007. Scheduling Algorithms. 5thed, Berlin: Springer.
   Google Scholar
• Cheng, T. C. E, Q. Ding, and B. M. T. Lin. 2004. “A Concise Survey of Scheduling with Time-Dependent Processing Times.” European Journal of Operational Research 152 (1): 1–13. doi: 10.1016/S0377-2217(02)00909-8
   Web of Science ®Google Scholar
• Cheng, T. C. E, and M. C. Gupta. 1989. “Survey of Scheduling Research Involving Due Date Determination Decisions.” European Journal of Operational Research 38 (2): 156–166. doi: 10.1016/0377-2217(89)90100-8
   Web of Science ®Google Scholar
• Cheng, T. C. E, L. Y. Kang, and C. T. Ng. 2004. “Due-Date Assignment and Single Machine Scheduling with Deteriorating Jobs.” Journal of the Operational Research Society 55 (2): 198–203. doi: 10.1057/palgrave.jors.2601681
   Web of Science ®Google Scholar
• Cheng, T. C. E, L. Y. Kang, and C. T. Ng. 2007. “Due-Date Assignment and Parallel-Machine Scheduling with Deteriorating Jobs.” Journal of the Operational Research Society 58 (8): 1103–1108. doi: 10.1057/palgrave.jors.2602225
   Web of Science ®Google Scholar
• Chubanov, S., M. Y. Kovalyo, and E. Pesch. 2006. “An FPTAS for a Single-Item Capacitated Economic Lot-Sizing Problem with Monotone Cost Structure.” Mathematical Programming 106 (3): 453–466. doi: 10.1007/s10107-005-0641-0
   Web of Science ®Google Scholar
• De, P., J. B. Ghosh, and C. E. Wells. 1991. “Optimal Delivery Time Quotation and Order Sequencing.” Decision Sciences 22 (2): 379–390. doi: 10.1111/j.1540-5915.1991.tb00353.x
   Web of Science ®Google Scholar
• Garey, M. R, and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of -Completeness. San Francisco, CA: W.H. Freeman.
   Google Scholar
• Gawiejnowicz, S. 2008. Time-Dependent Scheduling. Berlin: Springer.
   Google Scholar
• Gordon, V. S, C. N. Potts, V. A. Strusevich, and J. D. Whitehead. 2008. “Single Machine Scheduling Models with Deterioration and Learning: Handling Precedence Constraints via Priority Generation.” Journal of Scheduling 11 (5): 357–370. doi: 10.1007/s10951-008-0064-x
   Web of Science ®Google Scholar
• Gordon, V. S, J. M. Proth, and V. A. Strusevich. 2004. “Scheduling with Due Date Assignment.” In Handbook of Scheduling—Algorithms, Models, and Performance Analysis, edited by Joseph Y. T. Leung, 21-1–21-22. Boca Raton, FL: CRC Press.
   Google Scholar
• Gordon, V. S, and V. A. Strusevich. 2009. “Single Machine Scheduling and Due Date Assignment with Positionally Dependent Processing Times.” European Journal of Operational Research 198 (1): 57–62. doi: 10.1016/j.ejor.2008.07.044
   Web of Science ®Google Scholar
• Gordon, V. S, V. A. Strusevich, and A. Dolgui. 2012. “Scheduling with Due Date Assignment under Special Conditions on Job Processing.” Journal of Scheduling 15 (4): 447–456. doi: 10.1007/s10951-011-0240-2
   Web of Science ®Google Scholar
• Ibarra, O., and C. E. Kim. 1975. “Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems.” Journal of the Association for Computing Machinery 22 (4): 463–468. doi: 10.1145/321906.321909
   Web of Science ®Google Scholar
• Janiak, A., T. Krysiak, and R. Trela. 2011. “Scheduling Problems with Learning and Ageing Effects: A Survey.” Decision Making in Manufacturing and Services 5 (1-2): 19–36.
   Google Scholar
• Janiak, A., W. Janiak, T. Krysiak, and T. Kwiatkowski. 2015. “A Survey on Scheduling Problems with Due Windows.” European Journal of Operational Research 242 (2): 347–357. doi: 10.1016/j.ejor.2014.09.043
   Web of Science ®Google Scholar
• Kahlbacher, H. G, and T. C. E. Cheng. 1993. “Parallel Machine Scheduling to Minimize Costs for Earliness and Number of Tardy Jobs.” Discrete Applied Mathematics 47 (2): 139–164. doi: 10.1016/0166-218X(93)90088-6
   Web of Science ®Google Scholar
• Kaminsky, P., and D. Hochbaum. 2004. “Due Date Quotation Models and Algorithms.” In Handbook of Scheduling—Algorithms, Models, and Performance Analysis, edited by Joseph Y. T. Leung, 20-1–20-22. Boca Raton, FL: CRC Press.
   Google Scholar
• Kovalyov, M. Y. 1995. “Improving the Complexities of Approximation Algorithms for Optimization Problems.” Operations Research Letters 17 (2): 85–87. doi: 10.1016/0167-6377(95)91591-Z
   Web of Science ®Google Scholar
• Li, S. S, C. T. Ng, and J. J. Yuan. 2011. “Scheduling Deteriorating Jobs with CON/SLK Due Date Assignment on a Single Machine.” International Journal of Production Economics 131 (2): 747–751. doi: 10.1016/j.ijpe.2011.02.029
   Web of Science ®Google Scholar
• Liu, W., X. Hua, and X. Wang. Forthcoming. “Single Machine Scheduling with Slack Due Dates Assignment.” Engineering Optimization. doi: 10.1080/0305215X.2016.1197611.
   Google Scholar
• Liu, P., N. Yi, X. Zhou, and H. Gong. 2013. “Scheduling Two Agents with Sum-of-Processing-Times-Based Deterioration on a Single Machine.” Applied Mathematics and Computation 219 (17): 8848–8855. doi: 10.1016/j.amc.2013.03.040
   Web of Science ®Google Scholar
• Pinedo, M. 2012. Scheduling: Theory, Algorithms and Systems. 4th ed. Upper Saddle River, NJ: Prentice-Hall.
   Google Scholar
• Rudek, R. 2012. “ The Strong -Hardness of the Maximum Lateness Minimization Scheduling Problem with the Processing-Time Based Aging Effect.” Applied Mathematics and Computation 218 (11): 6498–6510. doi: 10.1016/j.amc.2011.12.020
   Web of Science ®Google Scholar
• Shabtay, D., N. Gaspar, and M. Kaspi. 2013. “A Survey on Offline Scheduling with Rejection.” Journal of Scheduling 16 (1): 3–28. doi: 10.1007/s10951-012-0303-z
   Web of Science ®Google Scholar
• Shabtay, D., and G. Steiner. 2007. “Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine.” Manufacturing & Service Operations Management 9 (3): 332–350. doi: 10.1287/msom.1060.0139
   Web of Science ®Google Scholar
• Slotnick, S. A., and M. J. Sobel. 2005. “Manufacturing Lead-Time Rules: Customer Retention Versus Tardiness Cost.” European Journal of Operational Research 169 (3): 825–856. doi: 10.1016/j.ejor.2003.07.023
   Web of Science ®Google Scholar
• Wang, D. J., Y. Yin, S. R. Cheng, T. C. E. Cheng, and C. C. Wu. 2015a. “Due Date Assignment and Scheduling on a Single Machine with Two Competing Agents.” International Journal of Production Research 54 (4): 1152–1169. doi: 10.1080/00207543.2015.1056317
   Web of Science ®Google Scholar
• Wang, D. J, Y. Yin, J. Xu, W. H. Wu, S. R. Cheng, and C. C. Wu. 2015b. “Some Due Date Determination Scheduling Problems with Two Agents on a Single Machine.” International Journal of Production Economics 168: 81–90. doi: 10.1016/j.ijpe.2015.06.018
   Web of Science ®Google Scholar
• Wang, J. B, and J. J. Wang. 2013. “Single-Machine Scheduling with Precedence Constraints and Position-Dependent Processing Times.” Applied Mathematical Modelling 37 (3): 649–658. doi: 10.1016/j.apm.2012.02.055
   Web of Science ®Google Scholar
• Yunqiang, Yin, T. C. E. Cheng, and Chin-Chia Wu. 2014. “Editorial: Scheduling with Time-Dependent Processing Times 2014.” Mathematical Problems in Engineering 2014, Article ID 201421. doi: 10.1155/2014/201421.
   Google Scholar
• Yunqiang, Yin, T. C. E. Cheng, Chin-Chia Wu. 2015. “Editorial: Scheduling with Time-Dependent Processing Times 2015.” Mathematical Problems in Engineering 2015, Article ID 367585. doi: 10.1155/2015/367585.
   Google Scholar
• Yunqiang, Yin, T. C. E. Cheng, and Chin-Chia Wu. Forthcoming. 0000. “Bi-Criterion Single-Machine Scheduling and Due-Window Assignment with Common Flow Allowances and Resource-Dependent Processing Times.” Journal of the Operational Research Society. doi: 10.1057/jors.2016.14.
   Google Scholar
• Zhang, X. G, and Y. Wang. 2015. “Single-Machine Scheduling CON/SLK Due Window Assignment Problems with Sum-of-Processed Times Based Learning Effect.” Applied Mathematics and Computation 250: 628–635. doi: 10.1016/j.amc.2014.11.011
   Web of Science ®Google Scholar
• Zhang, X. G., Y. Yin, and C. C. Wu. “Scheduling with Non-Decreasing Deteriorating Jobs and Variable Maintenance Activities on a Single Machine.” Engineering Optimization. doi: 10.1080/0305215X.2016.1163629.
   Google Scholar
• Zhao, C. L, C. J. Hsu, S. R. Cheng, Y. Q. Yin, and C. C. Wu. 2014. “Due Date Assignment and Single Machine Scheduling of Deteriorating Jobs to Minimize the Weighted Number of Tardy Jobs.” Applied Mathematics and Computation 248: 503–510. doi: 10.1016/j.amc.2014.09.095
   Web of Science ®Google Scholar
• Zhao, C. L, and H. Y. Tang. 2014. “A Note on Single Machine Scheduling and Due Date Assignment with General Position-Dependent Processing Times.” International Journal of Production Research 52 (9): 2807–2814. doi: 10.1080/00207543.2014.886025
   Web of Science ®Google Scholar