Single-machine batch delivery scheduling and common due-date assignment with a rate-modifying activity

References

• Birman, M., and G. Gur Mosheiov. 2004. “A Note on a Due-date Assignment on a Two-machine Flow-shop.” Computers & Operations Research 31: 473–480.
   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
• Chang, P.-C., S. H. Chen, and V. Mani. 2009. “A Note on Due-date Assignment and Single Machine Scheduling with a Learning/Aging Effect.” International Journal of Production Economics 117: 142–149.
   Web of Science ®Google Scholar
• Chen, Z. L. 1996. “Scheduling and Common Due Date Assignment with Earliness-tardiness Penalties and Batch Delivery Costs.” European Journal of Operational Research 93: 49–60.
   Web of Science ®Google Scholar
• Cheng, T. C. E., Z.-L. Chen, and N. V. Shakhlevich. 2002. “Common Due Date Assignment and Scheduling with Ready Times.” Computers and Operations Research 29: 1957–1967.
   Web of Science ®Google Scholar
• Cheng, T. C. E., and V. S. Gordon. 1994. “Batch Delivery Scheduling on a Single Machine.” Journal of the Operational Research Society 45: 1211–1215.
   Web of Science ®Google Scholar
• Cheng, T. C. E., and M. C. Gupta. 1989. “Survey of Scheduling Involving Due Date Determination Decisions.” European Journal of Operational Research 38: 156–166.
   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: 1103–1108.
   Web of Science ®Google Scholar
• Elyasi, A., and N. Salmasi. 2013. “Due Date Assignment in Single Machine with Stochastic Processing Times.” International Journal of Production Research 51 (8): 2352–2362.
   Web of Science ®Google Scholar
• Gordon, V., J. M. Proth, and C. B. Chu. 2002. “A Survey of the State-of-the-art of Common Due Date Assignment and Scheduling Research.” European Journal of Operational Research 139: 1–25.
   Web of Science ®Google Scholar
• Gordon, V. S., and V. A. Strusevich. 2009. “Single Machine Scheduling and Due Date Assignment with Positional Dependent Processing Times.” European Journal of Operational Research 198: 57–62.
   Web of Science ®Google Scholar
• Gordon, V., V. Strusevich, and A. Dolgui. 2012. “Scheduling with Due Date Assignment Under Special Conditions on Job Processing.” Journal of Scheduling 15 (4): 447–456.
   Web of Science ®Google Scholar
• Hermann, J. W., and C. Y. Lee. 1993. “On Scheduling to Minimize Earliness-tardiness and Batch Delivery Costs with a Common Due Date.” European Journal of Operational Research 70: 272–288.
   Web of Science ®Google Scholar
• Hsu, C.-J., T. C. E. Cheng, and D.-L. Yang. 2011. “Unrelated Parallel-machine Scheduling with Rate-modifying Activities to Minimize the Total Completion Time.” Information Sciences 181: 4799–4803.
   Web of Science ®Google Scholar
• Ji, M., and T. C. E. Cheng. 2010. “Scheduling with Job-dependent Learning Effects and Multiple Rate-modifying Activities.” Information Processing Letters 110 (1): 460–463.
   Web of Science ®Google Scholar
• Ji, M., Y. He, and T. C. E. Cheng. 2007. “Batch Delivery Scheduling with Batch Delivery Cost on a Single Machine.” European Journal of Operational Research 176: 745–755.
   Web of Science ®Google Scholar
• Koulamas, C. 2010. “A Faster Algorithm for a Due Date Assignment Problem with Tardy Jobs.” Operations Research Letters 38: 127–128.
   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: 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: 119–128.
   Web of Science ®Google Scholar
• Leyvand, Y., D. Shabtay, G. Steiner, and L. Yedidsion. 2010. “Just-in-time Scheduling with Controllable Processing Times on Parallel Machines.” Journal of Combinatorial Optimization 19: 347–368.
   Web of Science ®Google Scholar
• Li, S., C. T. Ng, and J. J. Yuan. 2011a. “Scheduling Deteriorating Jobs with CON/SLK Due Date Assignment on a Single Machine.” International Journal of Production Economics 131: 747–751.
   Web of Science ®Google Scholar
• Li, S., C. T. Ng, and J. J. Yuan. 2011b. “Group Scheduling and Due Date Assignment on a Single Machine.” International Journal of Production Economics 130: 230–235.
   Web of Science ®Google Scholar
• Mazdeh, M. M., S. Shashaani, A. Ashouri, and K. S. Hindi. 2011. “Single-machine Batch Scheduling Minimizing Weighted Flow Times and Delivery Costs.” Applied Mathematical Modelling 35: 563–570.
   Web of Science ®Google Scholar
• Mosheiov, G., and A. Sarig. 2009. “Scheduling a Maintenance Activity and Due-window Assignment on a Single Machine.” Computers and Operations Research 36: 2541–2545.
   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: 528–544.
   Web of Science ®Google Scholar
• Ng, C. T., 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.” Computers 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
• Potts, C. N., and M. Y. Kovalyov. 2000. “Scheduling with Batching: A Review.” European Journal of Operational Research 120: 228–249.
   Web of Science ®Google Scholar
• Rustogi, K., and V. A. Strusevich. 2012. “Single Machine Scheduling with General Positional Deterioration and Rate-modifying Maintenance.” Omega 40: 791–804.
   Web of Science ®Google Scholar
• Selvarajah, E., G. Steiner, and R. Zhang. 2013. “Single Machine Batch Scheduling with Release Times and Delivery Costs.” Journal of Scheduling 16: 69–79.
   Web of Science ®Google Scholar
• Seidmann, A., S. S. Panwalkar, and M. L. Smith. 1981. “Optimal Assignment of Due Dates for a Single Processor Scheduling Problem.” International Journal of Production Research 19: 393–399.
   Web of Science ®Google Scholar
• Shabtay, D. 2010. “Scheduling and Due Date Assignment to Minimize Earliness, Tardiness, Holding, Due Date Assignment and Batch Delivery Costs.” International Journal of Production Economics 123: 235–242.
   Web of Science ®Google Scholar
• Shabtay, D., Y. Itskovich, L. Yedidsion, and D. Oron. 2010. “Optimal Due Date Assignment and Resource Allocation in a Group Technology Scheduling Environment.” Computers & Operations Research 37: 2218–2228.
   Web of Science ®Google Scholar
• Shabtay, D., and G. Steiner. 2008a. “Optimal Due Date Assignment in Multi-machine Scheduling Environments.” Journal of Scheduling 11: 217–228.
   Web of Science ®Google Scholar
• Shabtay, D., and G. Steiner. 2008b. “The Single-machine Earliness-tardiness Scheduling Problem with Due Date Assignment and Resource-dependent Processing Times.” Annals of Operations Research 159: 25–40.
   Web of Science ®Google Scholar
• Shabtay, D., G. Steiner, and L. Yedidsion. 2010. “Bicriteria Problems to Minimize Maximum Tardiness and Due Date Assignment Cost in Various Scheduling Environments.” Discrete Applied Mathematics 158: 1090–1103.
   Web of Science ®Google Scholar
• Steiner, G., and R. Zhang. 2009. “Approximation Algorithms for Minimizing the Total Weighted Number of Late Jobs with Late Deliveries in Two-level Supply Chains.” Journal of Scheduling 12: 565–574.
   Web of Science ®Google Scholar
• Steiner, G., and R. Zhang. 2011. “Minimizing the Weighted Number of Tardy Jobs with Due Date Assignment and Capacity-constrained Deliveries.” Annals of Operations Research 191: 171–181.
   Web of Science ®Google Scholar
• T’kindt, V., and F. D. Croce. 2012. “A note on ‘Two-machine Flow-shop Scheduling with Rejection’ and its Link with Flow-shop Scheduling and Common Due Date Assignment.” Computers & Operations Research 39: 3244–3246.
   Web of Science ®Google Scholar
• Tuong, N. H., and A. Soukhal. 2010. “Due Dates Assignment and JIT Scheduling with Equal-size Jobs.” European Journal of Operational Research 205: 280–289.
   Web of Science ®Google Scholar
• Wang, G. Q., and T. C. E. Cheng. 2000. “Parallel Machine Scheduling with Batch Delivery Costs.” International Journal of Production Economics 68: 177–183.
   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, X. Y., and M. Z. Wang. 2010. “Single Machine Common Flow Allowance Scheduling with a Rate-modifying Activity.” Computers & Industrial Engineering 59: 898–902.
   Web of Science ®Google Scholar
• Yang, S. J., C.-J. Hsu, and D.-L. Yang. 2010. “Single-machine Scheduling with Due-date Assignment and Aging Effect under a Deteriorating Maintenance Activity Consideration.” International Journal of Information and Management Sciences 21: 177–195.
   Google Scholar
• Yedidsion, L., D. Shabtay, and G. Steiner. 2010. “Optimal Delivery Time Quotation to Minimize Total Tardiness Penalties with Controllable Processing Times.” IIE Transactions 42: 221–231.
   Web of Science ®Google Scholar
• Yin, Y. Q., 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
• Yin, Y. Q., 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: 5083–5099.
   Web of Science ®Google Scholar
• Yin, Y. Q., T. C. E. Cheng, D. H. Xu, and C. C. Wu. 2012. “Common Due Date Assignment and Scheduling with a Rate-modifying Activity to Minimize the Due Date, Earliness, Tardiness, Holding, and Batch Delivery Cost.” Computers & Industrial Engineering 63: 223–234.
   Web of Science ®Google Scholar
• Yin, Y. Q., M. Liu, T. C. E. Cheng, C.-C. Wu, and S.-R. Cheng. 2013. “Four Single-machine Scheduling Problems Involving Due Date Determination Decisions.” Information Sciences 251: 164–181.
   Web of Science ®Google Scholar
• Zhao, C. L., and H. Y. Tang. 2012. “A Note to Due-window Assignment and Single Machine Scheduling with Deteriorating Jobs and a Rate-modifying Activity.” Computers & Operations Research 39: 1300–1303.
   Web of Science ®Google Scholar
• Zhao, C. L., H. Y. Tang, and C. D. Cheng. 2009. “Two-parallel Machines Scheduling with Rate-modifying Activities to Minimize Total Completion Time.” European Journal of Operational Research 198: 354–357.
   Web of Science ®Google Scholar