Due-window assignment and scheduling with general position-dependent processing times involving a deteriorating and compressible maintenance activity

References

• Alidaee, B., N. K. Womer. 1999. “Scheduling with Time Dependent Processing Times: Review and Extensions.” Journal of the Operational Research Society 50 (7): 711–720.
   Web of Science ®Google Scholar
• Bachman, A., and A. Janiak. 2004. “Scheduling Jobs with Position-dependent Processing Times.” Journal of the Operational Research Society 55 (3): 257–264.
   Web of Science ®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. http://www.sciencedirect.com/science/article/pii/S0377221707005280.
   Web of Science ®Google Scholar
• Chen, B., C. N. Potts, and G. J. Woeginger. 1999. “A Review of Machine Scheduling: Complexity, Algorithms and Approximability.” In Handbook of combinatorial optimization, edited by D.-Z. Du and P. M. Pardalos. 1493–1641. 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.
   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.
   Web of Science ®Google Scholar
• Cheng, T. C. E., S.-J. Yang, and D.-L. Yang. 2012. “Common Due-window Assignment and Scheduling of Linear Time-dependent Deteriorating Jobs and a Deteriorating Maintenance Activity.” International Journal of Production Economics 135 (1): 154–161.
   Web of Science ®Google Scholar
• Gawiejnowicz, S. 2008. Time-dependent Scheduling. Berlin: Springer.
   Google Scholar
• Gordon, V. S., J.-M. Proth, and C.-B. Chu. 2002. “A Survey of Tthe State-of-the-art of Common Due Date Assignment and Scheduling Research.” European Journal of Operational Research 139 (1): 1–25.
   Web of Science ®Google Scholar
• Gordon, V. S., V. Strusevich, and A. Dolgui. 2012. “Scheduling with Due Date Assignment under Special Conditions on Job Processing.” Journal of Scheduling15 (4):447–456. http://dx.doi.org/10.1007/s10951-011-0240-2.
   Web of Science ®Google Scholar
• Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. H. G. Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.” Annals of discrete Mathematics 5: 287–326.
   Google Scholar
• He, Y., M. Ji, and T. C. E. Cheng. 1989. “Single Machine Scheduling with a Restricted Rate-modifying Activity.” Naval Research Logistics 52 (4): 361–369.
   Web of Science ®Google Scholar
• Hsu, C.-J., S.-J. Yang, and D.-L. Yang. 2011. “Two Due Date Assignment Problems with Position-dependent Processing Time on a Single-machine.” Computers & Industrial Engineering 60 (4): 796–800.
   Web of Science ®Google Scholar
• Ji, M., J. Ge, K. Chen, and T. C. E. Cheng. 2013. “Single-machine Due-window Assignment and Scheduling with Resource Allocation, Aging Effect, and a Deteriorating Rate-modifying Activity.” Computers & Industrial Engineering 66 (4): 952–961.
   Web of Science ®Google Scholar
• Józefowska, J. 2007. Just-in-time Scheduling: Models and Algorithms for Computer and Manufacturing Systems. Vol. 106. New York: Springer.
   Google Scholar
• Kanet, J. J. 1981. “Minimizing the Average Deviation of Job Completion Times about a Common Due Date.” Naval Research Logistics 28 (4): 643–651.
   Web of Science ®Google Scholar
• Karimi-Nasab, M., and S. M. T. Fatemi Ghomi. 2012. “Multi-objective Production Scheduling with Controllable Processing Times and Sequence-dependent Setups for Deteriorating Items.” International Journal of Production Research 50 (24): 7378–7400.
   Web of Science ®Google Scholar
• Karimi-Nasab, M., S. M. Seyedhoseini, M. Modarres, and M. Heidari. 2013. “Multi-period Lot Sizing and Job Shop Scheduling with Compressible Process Times for Multilevel Product Structures.” International Journal of Production Research 51 (20): 6229–6246.
   Web of Science ®Google Scholar
• Kubzin, M. A., and V. A. Strusevich. 2006. “Planning Machine Maintenance in Two-machine Shop Scheduling.” Operations Research 54 (4): 789–800. doi:10.1287/opre.1060.0301.
   Web of Science ®Google Scholar
• Lauff, V., and F. Werner. 2004. “Scheduling with Common Due Date, Earliness and Tardiness Penalties for Multimachine Problems: A Survey.” Mathematical and Computer Modelling 40 (5): 637–655.
   Web of Science ®Google Scholar
• Lee, C.-Y., and V. J. Leon. 2001. “Machine Scheduling with a Rate-modifying Activity.” European Journal of Operational Research 128 (1): 119–128.
   Web of Science ®Google Scholar
• Liman, S. D., S. S. Panwalkar, and S. Thongmee. 1996. “Determination of Common Due Window Location in a Single Machine Scheduling Problem.” European Journal of Operational Research 93 (1): 68–74.
   Web of Science ®Google Scholar
• Liman, S. D., S. S. Panwalkar, and S. Thongmee. 1998. “Common Due Window Size and Location Determination in a Single Machine Scheduling Problem.” Journal of the Operational Research Society:1007–1010.
   Web of Science ®Google Scholar
• Lodree, J., J. Emmett, and C. D. Geiger. 2010. “A Note on the Optimal Sequence Position for a Rate-modifying Activity under Simple Linear Deterioration.” European Journal of Operational Research 201 (2): 644–648.
   Web of Science ®Google Scholar
• Luo, W., L. Chen, and G. Zhang. 2010. “Approximation Algorithms for Scheduling with a Variable Machine Maintenance.” In Algorithmic Aspects in Information and Management, edited by Bo Chen. 209–219. Berlin: Springer.
   Google Scholar
• Luo, W., and M. Ji. 2015. “Scheduling a Variable Maintenance and Linear Deteriorating Jobs on a Single Machine.” Information Processing Letters 115 (1): 33–39.
   Web of Science ®Google Scholar
• Mokhtari, H., I. N. K. Abadi, and A. Cheraghalikhani. 2011. “A Multi-objective Flow Shop Scheduling with Resource-dependent Processing Times: Trade-Off between Makespan and Cost of Resources.” International Journal of Production Research 49 (19): 5851–5875.
   Web of Science ®Google Scholar
• Mosheiov, G., and D. Oron. 2012. “Minimizing the Number of Tardy Jobs on a Proportionate Flowshop with General Position-dependent Processing Times.” Computers & Operations Research 39 (7):1601–1604. http://www.sciencedirect.com/science/article/pii/S0305054811002723.
   Web of Science ®Google Scholar
• Mosheiov, G., and A. Sarig. 2008. “A Due-window Assignment Problem with Position-dependent Processing Times.” Journal of the Operational Research Society 59 (7): 997–1003.
   Web of Science ®Google Scholar
• Mosheiov, G., and A. Sarig. 2009. “Scheduling a Maintenance Activity and Due-window Assignment on a Single Machine.” Computers & Operations Research 36 (9): 2541–2545.
   Web of Science ®Google Scholar
• Mosheiov, G., and J. B. Sidney. 2003. “New Results on Sequencing with Rate Modification.” INFOR 41: 155–163.
   Web of Science ®Google Scholar
• Mosheiov, G., and J. B. Sidney. 2010. “Scheduling a Deteriorating Maintenance Activity on a Single Machine.” Journal of the Operational Research Society 61 (5): 882–887.
   Web of Science ®Google Scholar
• Nowicki, E., and S. Zdrzałka. 1990. “A Survey of Results for Sequencing Problems with Controllable Processing Times.” Discrete Applied Mathematics 26 (2): 271–287.
   Web of Science ®Google Scholar
• Panwalkar, S. S., M. L. Smith, and A. Seidmann. 1982. “Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem.” Operations Research 30 (2): 391–399.
   Web of Science ®Google Scholar
• Papadimitriou, C. H., and K Steiglitz. 1998. Combinatorial Optimization: Algorithms and Complexity. New York: Courier Dover Publications.
   Google Scholar
• Shabtay, D., and G. Steiner. 2007. “A Survey of Scheduling with Controllable Processing Times.” Discrete Applied Mathematics 155 (13): 1643–1666.
   Web of Science ®Google Scholar
• Su, L.-H., and C.-Y. Lien. 2009. “Scheduling Parallel Machines with Resource-dependent Processing Times.” International Journal of Production Economics 117 (2): 256–266.
   Web of Science ®Google Scholar
• Van, W., N. Luk, and K. R. Baker. 1982. “A Bicriterion Approach to Time/Cost Trade-Offs in Sequencing.” European Journal of Operational Research 11 (1): 48–54.
   Web of Science ®Google Scholar
• Vickson, R. G. 1980a. “Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine.” Operations Research 28 (5): 1155–1167. doi:10.1287/opre.28.5.1155.
   Web of Science ®Google Scholar
• Vickson, R. G. 1980b. “Two Single Machine Sequencing Problems Involving Controllable Job Processing Times.” AIIE transactions 12 (3): 258–262.
   Web of Science ®Google Scholar
• Wang, X.-Y., and J.-J. Wang. 2013. “Single-machine Due Date Assignment Problem with Deteriorating Jobs and Resource-dependent Processing Times.” The International Journal of Advanced Manufacturing Technology 67 (1–4): 255–260.
   Web of Science ®Google Scholar
• Wang, J.-J., J.-B. Wang, and F. Liu. 2011. “Parallel Machines Scheduling with a Deteriorating Maintenance Activity.” Journal of the Operational Research Society 62 (10): 1898–1902.
   Web of Science ®Google Scholar
• Xu, D., Y. Yin, and H. Li. 2010. “Scheduling Jobs under Increasing Linear Machine Maintenance Time.” Journal of Scheduling 13 (4): 443–449.
   Web of Science ®Google Scholar
• Yang, D.-L., T. C. E. Cheng, and S.-J. Yang. 2014. “Parallel-machine Scheduling with Controllable Processing Times and Rate-modifying Activities to Minimise Total Cost Involving Total Completion Time and Job Compressions.” International Journal of Production Research 52 (4): 1133–1141.
   Web of Science ®Google Scholar
• Yang, S.-J., and C.-J. Lai. 2014. “Scheduling with Multiple Common Due Windows Assignment and General Position-dependent and Resource-dependent Processing Times.” International Journal of Information and Management Sciences 25 (2): 101–120.
   Google Scholar
• Yang, D.-L., C.-J. Lai, and S.-J. Yang. 2014. “Scheduling Problems with Multiple Due Windows Assignment and Controllable Processing Times on a Single Machine.” International Journal of Production Economics 150: 96–103.
   Web of Science ®Google Scholar
• Yang, S.-J., H.-T. Lee, and J.-Y. Guo. 2013. “Multiple Common Due Dates Assignment and Scheduling Problems with Resource Allocation and General Position-dependent Deterioration Effect.” The International Journal of Advanced Manufacturing Technology 67 (1–4): 181–188.
   Web of Science ®Google Scholar
• Yang, S.-J., D.-L. Yang, and T. C. E. Cheng. 2010. “Single-machine Due-window Assignment and Scheduling with Job-dependent Aging Effects and Deteriorating Maintenance.” Computers & Operations Research 37 (8): 1510–1514.
   Web of Science ®Google Scholar
• Yeung, W.-K., C. Oğuz, and T. C. E. Cheng. 2001a. “Single-machine Scheduling with a Common Due Window.” Computers & Operations Research 28 (2): 157–175.
   Web of Science ®Google Scholar
• Yeung, W.-K., C. Oğuz, and T. C. E. Cheng. 2001b. “Minimizing Weighted Number of Early and Tardy Jobs with a Common Due Window Involving Location Penalty.” Annals of Operations Research 108 (1–4): 33–54.
   Web of Science ®Google Scholar
• Yeung, W.-K., C. Oğuz, and T. C. E. Cheng. 2004. “Two-stage Flowshop Earliness and Tardiness Machine Scheduling Involving a Common Due Window.” International Journal of Production Economics 90 (3): 421–434.
   Web of Science ®Google Scholar
• Yeung, W.-K., C. Oğuz, and T. C. E. Cheng. 2009. “Two-machine Flow Shop Scheduling with Common Due Window to Minimize Weighted Number of Early and Tardy Jobs.” Naval Research Logistics (NRL) 56 (7): 593–599.
   Web of Science ®Google Scholar
• Yin, Y., T. C. E. Cheng, C.-J. Hsu, and C.-C. Wu. 2013. “Single-machine Batch Delivery Scheduling with an Assignable Common Due Window.” Omega 41 (2): 216–225.
   Web of Science ®Google Scholar
• Yin, Y., T. C. E. Cheng, J.-Y. Wang, and C.-C. Wu. 2013. “Single-machine Common Due Window Assignment and Scheduling to Minimize the Total Cost.” Discrete Optimization 10 (1): 42–53.
   Web of Science ®Google Scholar
• Yin, Y., T. C. E. Cheng, C.-C. Wu, and S.-R. Cheng. 2013. “Single-machine Common Due-date Scheduling with Batch Delivery Costs and Resource-dependent Processing Times.” International Journal of Production Research 51 (17): 5083–5099.
   Web of Science ®Google Scholar
• Yin, Y., D. Xu, K. Sun, and H. Li. 2009. “Some Scheduling Problems with General Position-dependent and Time-dependent Learning Effects.” Information Sciences 179 (14): 2416–2425.
   Web of Science ®Google Scholar
• Zhao, C., and H. Tang. 2010. “Single Machine Scheduling with General Job-dependent Aging Effect and Maintenance Activities to Minimize Makespan.” Applied Mathematical Modelling 34 (3): 837–841.
   Web of Science ®Google Scholar