Single machine scheduling to minimise resource consumption cost with a bound on scheduling plus due date assignment penalties

References

• Akturk, M. S., and T. Ilhan. 2011. “Single CNC Machine Scheduling with Controllable Processing Times to Minimize Total Weighted Tardiness.” Computers and Operations Research 38 (4): 771–781.
   Web of Science ®Google Scholar
• Alidaee, B., and A. Ahmadian. 1993. “Two Parallel Machine Sequencing Problems Involving Controllable Job Processing Times.” European Journal of Operational Research 70: 335–341.
   Web of Science ®Google Scholar
• Armstrong, R., S. Gu, and L. Lei. 1995. “An Algorithm for the Two-resource Allocation Problem with a Non-differentiable Convex Objective Function.” Journal of the Operational Research Society 46: 116–122.
   Web of Science ®Google Scholar
• Armstrong, R., S. Gu, and L. Lei. 1997. “Solving a Class of Two-resource Allocation Problem by Equivalent Load Method.” Journal of the Operational Research Society 48: 818–825.
   Web of Science ®Google Scholar
• Biskup, D., and T. C. E. Cheng. 1999. “Single-Machine Scheduling with Controllable Processing Times and Earliness.” Tardiness and Completion Time Penalties, Engineering Optimization 31: 329–336.
   Web of Science ®Google Scholar
• Biskup, D., and H. Jahnke. 2001. “Common due date Assignment for Scheduling on a Single Machine with Jointly Reducible Processing Times.” International Journal of Production Economics 69: 317–322.
   Web of Science ®Google Scholar
• Chen, Z. L. 1996. “Scheduling and Common due date Assignment with Earliness Penalties and Batch Delivery Costs.” European Journal of Operational Research 93: 49–60.
   Web of Science ®Google Scholar
• Cheng, T. C. E., C. Oğaz, and X. D. Qi. 1996. “Due-date Assignment and Single Machine Scheduling with Compressible Processing Times.” International Journal of Production Economics 43: 29–35.
   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: 379–390.
   Web of Science ®Google Scholar
• Do Lago, D. G., E. R. M. Madeira, and L. F. Bittencourt. 2011. “Power-aware Virtual Machine Scheduling on Clouds Using Active Cooling Control and DVFS.” In: Proceedings of the 9th International Workshop on Middleware for Grids, Clouds and e-Science (MGC ’11), Lisbon, Portugal, 1–6.
   Google Scholar
• Flynn, M. J., P. Hung, and K. W. Rudd. 1999. “Deep-submicron Microprocessor Design Issues.” IEEE Micro 19 (4): 11–22.
   Web of Science ®Google Scholar
• Gurel, S., and M. S. Akturk. 2007. “Considering Manufacturing Cost and Scheduling Performance on a CNC Turning Machine.” European Journal of Operational Research 177: 325–343.
   Web of Science ®Google Scholar
• Irani, S., and K. Pruhs. 2005. “Algorithmic Problems in Power Management.” SIGACT News 36 (2): 63–76.
   Google Scholar
• Janiak, A., and M. Y. Kovalyov. 1996. “Single Machine Scheduling Subject to Deadlines and Resource Dependent Processing Times.” European Journal of Operational Research 94: 284–291.
   Web of Science ®Google Scholar
• Ji, M., K. Chen, J. J. Ge, and T. C. E. Cheng. 2014. “Group Scheduling and Job-dependent due Window Assignment Based on a Common Flow Allowance.” Computers & Industrial Engineering 68: 35–41.
   Web of Science ®Google Scholar
• Ji, M., X. Zhang, X. Y. Tang, T. C. E. Cheng, G. Y. Wei, and Y. Y. Tan. 2016. “Group Scheduling with Group-Dependent Multiple due Windows Assignment.” International Journal of Production Research 54 (4): 1244–1256.
   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: 139–164.
   Web of Science ®Google Scholar
• Lee, C. Y., and L. Lei. 2001. “Multiple-project Scheduling with Controllable Project Duration and Hard Resource Constraint: Some Solvable Cases.” Annals of Operation Research 102: 287–307.
   Web of Science ®Google Scholar
• Leyvand, Y., D. Shabtay, and G. Steiner. 2010a. “Optimal Delivery Time Quotation to Minimize Total Tardiness Penalties with Controllable Processing Times.” IIE Transactions 42 (3): 221–231.
   Web of Science ®Google Scholar
• Leyvand, Y., D. Shabtay, and G. Steiner. 2010b. “A Unified Approach for Scheduling with Convex Resource Consumption Functions Using Positional Penalties.” European Journal of Operational Research 206 (2): 301–312.
   Web of Science ®Google Scholar
• Liman, S. D., S. S. Panwalkar, and S. Thongmee. 1997. “A Single Machine Scheduling Problem with Common due Window and Controllable Processing Times.” Annals of Operations Research 70: 145–154.
   Web of Science ®Google Scholar
• Long, J., Z. Zheng, and X. Gao. 2017. “Dynamic Scheduling in Steelmaking-continuous Casting Production for Continuous Caster Breakdown.” International Journal of Production Research 55: 3197–3216.
   Web of Science ®Google Scholar
• Monma, C. L., A. Schrijver, M. J. Todd, and V. K. Wei. 1990. “Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality.” Complexity, Special Cases and Extensions, Mathematics of Operations Research 15: 736–748.
   Web of Science ®Google Scholar
• Mosheiov, G., and U. Yovel. 2006. “Minimizing Weighted Earliness-tardiness and due-date Cost with Unit Processing-time Jobs.” European Journal of Operational Research 172 (2): 528–544.
   Web of Science ®Google Scholar
• Ng, C. T. D., T. C. E. Cheng, M. Y. Kovalyov, and S. S. Lam. 2003. “Single Machine Scheduling with a Variable Common due date and Resource-dependent Processing Times.” Computer and Operations Research 30: 1173–1185.
   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: 391–399.
   Web of Science ®Google Scholar
• Rasti-Barzoki, M., and S. R. Hejazi. 2015. “Pseudo-polynomial Dynamic Programming for an Integrated due date Assignment.” Resource Allocation, Production, and Distribution Scheduling Model in Supply Chain Scheduling, Applied Mathematical Modelling 39 (12): 5371–5380.
   Web of Science ®Google Scholar
• Sahni, S. 1976. “Algorithms for Scheduling Independent Tasks.” Journal of the ACM 23 (1): 116–127.
   Web of Science ®Google Scholar
• Scott, S. C., and T. R. Jefferson. 1995. “Allocation of Resources in Project Management.” International Journal of Systems Science 26 (2): 413–420.
   Web of Science ®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
• 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.
   Web of Science ®Google Scholar
• Shabtay, D., and G. Steiner. 2011. “A Bicriteria Approach to Minimize the Total Weighted Number of Tardy Jobs with Convex Controllable Processing Times and Assignable due dates.” Journal of Scheduling 14: 455–469.
   Web of Science ®Google Scholar
• Shabtay, D., G. Steiner, and R. Zhang. 2016. “Optimal Coordination of Resource Allocation, due date Assignment and Scheduling Decisions.” Omega 65: 41–54.
   Web of Science ®Google Scholar
• Shabtay, D., L. Yedidsion, Y. Itskovich, and D. Oron. 2010. “Optimal due dates Assignment and Resource Allocation in Group Technology Scheduling Environment.” Computers and Operations Research 37 (12): 2218–2228.
   Web of Science ®Google Scholar
• Tang, L., Y. Zhao, and J. Liu. 2014. “An Improved Differential Evolution Algorithm for Practical Dynamic Scheduling in Steelmaking-continuous Casting Production.” IEEE Transactions on Evolutionary Computation 18: 209–225.
   Web of Science ®Google Scholar
• T’kindt, V., and J.-C. Billaut. 2006. Multicriteria Scheduling: Theory, Models and Algorithms. 2nd ed. Berlin: Springer.
   Google Scholar
• Turkcan, A., M. S. Akturk, and R. H. Storer. 2009. “Predictive/Reactive Scheduling with Controllable Processing Times and Earliness-tardiness Penalties.” IIE Transactions 41: 1080–1095.
   Web of Science ®Google Scholar
• Von Laszewski, G., L. Wang, A. J. Younge, and X. He. 2009. “Power-aware Scheduling of Virtual Machines in DVFS-enabled Clusters.” IEEE International Conference on Cluster Computing and Workshops (CLUSTER ’09), New Orleans, LA, 1–10.
   Google Scholar
• Wang, J. B., and Q. Guo. 2010. “A due-date Assignment Problem with Learning Effect and Deteriorating Jobs.” Applied Mathematical Modelling 34 (2): 309–313.
   Web of Science ®Google Scholar
• Wang, J. B., and Q. Guo. 2010. “A due-date Assignment Problem with Learning Effect and Deteriorating Jobs.” Applied Mathematical Modelling 34: 309–313.
   Web of Science ®Google Scholar
• Wang, D., Y. Yin, and T. C. E. Cheng. 2017. “A Bicriterion Approach to Common Flow Allowances due Window Assignment and Scheduling with Controllable Processing Times.” Naval Research Logistics 64: 41–63.
   Web of Science ®Google Scholar
• Wei, C. M., J. B. Wang, and P. Ji. 2012. “Single-machine Scheduling with Time-and-resource-dependent Processing Times.” Applied Mathematical Modelling 36 (2): 792–798.
   Web of Science ®Google Scholar
• Wu, C.-M., R.-S. Chang, and H.-Y. Chan. 2014. “A Green Energy-efficient Scheduling Algorithm Using the DVFS Technique for Cloud Datacenters.” Future Generation Computer Systems 37: 141–147.
   Web of Science ®Google Scholar
• Yang, S. W., L. Wan, and N. Yin. 2015. “Research on Single Machine SLK/DIF due Window Assignment Problem with Learning Effect and Deteriorating Jobs.” Applied Mathematical Modelling 39: 4593–4598.
   Web of Science ®Google Scholar
• Yao, F., A. Demers, and S. Shenker. 1995. A Scheduling Model for Reduced CPU Energy, 374–382. Los Alamitos, CA: IEEE Syposium on Foundations of Computer 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: 216–225.
   Web of Science ®Google Scholar
• Zhu, Z. G., F. Chu, L. Y. Sun, and M. Liu. 2013. “Single Machine Scheduling with Resource Allocation and Learning Effect Considering the Rate-modifying Activity.” Applied Mathematical Modelling 37: 5371–5380.
   Web of Science ®Google Scholar