IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v123y2010i1p235-242.html
   My bibliography  Save this article

Scheduling and due date assignment to minimize earliness, tardiness, holding, due date assignment and batch delivery costs

Author

Listed:
  • Shabtay, Dvir

Abstract

We study a batch delivery single machine scheduling problem where the due dates are controllable and the objective is to minimize earliness, tardiness, holding, due date assignment and delivery costs. The earliness, tardiness and holding cost are assumed to be proportional to the corresponding duration. For each customer order (job) there is a specific acceptable lead time that the customer who placed the order considers to be reasonable and acceptable and therefore there is no penalty by assigning a due date not greater than the acceptable lead time. If the due date is greater than the acceptable date then the due date cost is proportional to the deviation from the acceptable lead time. The batch delivery cost is fixed and there is no capacity limitation on the size of a batch. We provide some properties of the optimal schedule, and prove that the problem is -hard. A polynomial time optimization algorithm is presented for two special cases. The first is the case of equal processing times and the second is the case where the acceptable lead times are all equal to zero and the holding penalty is less than the tardiness or due date assignment penalty.

Suggested Citation

  • Shabtay, Dvir, 2010. "Scheduling and due date assignment to minimize earliness, tardiness, holding, due date assignment and batch delivery costs," International Journal of Production Economics, Elsevier, vol. 123(1), pages 235-242, January.
    • Handle: RePEc:eee:proeco:v:123:y:2010:i:1:p:235-242
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(09)00304-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Herrmann, Jeffrey W. & Lee, Chung-Yee, 1993. "On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date," European Journal of Operational Research, Elsevier, vol. 70(3), pages 272-288, November.
    2. Adamopoulos, G. I. & Pappis, C. P., 1995. "The CON due-date determination method with processing time-dependent lateness penalties," International Journal of Production Economics, Elsevier, vol. 40(1), pages 29-36, June.
    3. Kenneth R. Baker & Gary D. Scudder, 1990. "Sequencing with Earliness and Tardiness Penalties: A Review," Operations Research, INFORMS, vol. 38(1), pages 22-36, February.
    4. Chang, Pei-Chann & Chen, Shih-Hsin & Mani, V., 2009. "A note on due-date assignment and single machine scheduling with a learning/aging effect," International Journal of Production Economics, Elsevier, vol. 117(1), pages 142-149, January.
    5. Biskup, Dirk & Jahnke, Hermann, 2001. "Common due date assignment for scheduling on a single machine with jointly reducible processing times," International Journal of Production Economics, Elsevier, vol. 69(3), pages 317-322, February.
    6. Gordon, Valery & Proth, Jean-Marie & Chu, Chengbin, 2002. "A survey of the state-of-the-art of common due date assignment and scheduling research," European Journal of Operational Research, Elsevier, vol. 139(1), pages 1-25, May.
    7. S. S. Panwalkar & M. L. Smith & A. Seidmann, 1982. "Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem," Operations Research, INFORMS, vol. 30(2), pages 391-399, April.
    8. Panwalkar, S. S. & Rajagopalan, R., 1992. "Single-machine sequencing with controllable processing times," European Journal of Operational Research, Elsevier, vol. 59(2), pages 298-302, June.
    9. Chen, Zhi-Long, 1996. "Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs," European Journal of Operational Research, Elsevier, vol. 93(1), pages 49-60, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li, Shisheng & Ng, C.T. & Yuan, Jinjiang, 2011. "Group scheduling and due date assignment on a single machine," International Journal of Production Economics, Elsevier, vol. 130(2), pages 230-235, April.
    2. Yin, Yunqiang & Cheng, T.C.E. & Hsu, Chou-Jung & Wu, Chin-Chia, 2013. "Single-machine batch delivery scheduling with an assignable common due window," Omega, Elsevier, vol. 41(2), pages 216-225.
    3. Yunqiang Yin & Doudou Li & Dujuan Wang & T. C. E. Cheng, 2021. "Single-machine serial-batch delivery scheduling with two competing agents and due date assignment," Annals of Operations Research, Springer, vol. 298(1), pages 497-523, March.
    4. Su, Ling-Huey & Tien, Yi-Yu, 2011. "Minimizing mean absolute deviation of completion time about a common due window subject to maximum tardiness for a single machine," International Journal of Production Economics, Elsevier, vol. 134(1), pages 196-203, November.
    5. Selvarajah, Esaignani & Zhang, Rui, 2014. "Supply chain scheduling at the manufacturer to minimize inventory holding and delivery costs," International Journal of Production Economics, Elsevier, vol. 147(PA), pages 117-124.
    6. Sang, Yao-Wen & Wang, Jun-Qiang & Sterna, Małgorzata & Błażewicz, Jacek, 2023. "Single machine scheduling with due date assignment to minimize the total weighted lead time penalty and late work," Omega, Elsevier, vol. 121(C).
    7. Xingong, Zhang & Yong, Wang, 2015. "Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect," Applied Mathematics and Computation, Elsevier, vol. 250(C), pages 628-635.
    8. Janiak, Adam & Krysiak, Tomasz, 2012. "Scheduling jobs with values dependent on their completion times," International Journal of Production Economics, Elsevier, vol. 135(1), pages 231-241.
    9. Li, Shisheng & Ng, C.T. & Yuan, Jinjiang, 2011. "Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine," International Journal of Production Economics, Elsevier, vol. 131(2), pages 747-751, June.
    10. Yu-Cheng Wang & Horng-Ren Tsai & Toly Chen, 2021. "A Selectively Fuzzified Back Propagation Network Approach for Precisely Estimating the Cycle Time Range in Wafer Fabrication," Mathematics, MDPI, vol. 9(12), pages 1-18, June.
    11. Vinod, V. & Sridharan, R., 2011. "Simulation modeling and analysis of due-date assignment methods and scheduling decision rules in a dynamic job shop production system," International Journal of Production Economics, Elsevier, vol. 129(1), pages 127-146, January.
    12. Yunqiang Yin & Yongjian Yang & Dujuan Wang & T.C.E. Cheng & Chin‐Chia Wu, 2018. "Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(5), pages 393-409, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Shabtay, Dvir & Steiner, George & Zhang, Rui, 2016. "Optimal coordination of resource allocation, due date assignment and scheduling decisions," Omega, Elsevier, vol. 65(C), pages 41-54.
    2. Gordon, Valery & Proth, Jean-Marie & Chu, Chengbin, 2002. "A survey of the state-of-the-art of common due date assignment and scheduling research," European Journal of Operational Research, Elsevier, vol. 139(1), pages 1-25, May.
    3. Dvir Shabtay & George Steiner, 2008. "The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times," Annals of Operations Research, Springer, vol. 159(1), pages 25-40, March.
    4. Li, Shisheng & Ng, C.T. & Yuan, Jinjiang, 2011. "Group scheduling and due date assignment on a single machine," International Journal of Production Economics, Elsevier, vol. 130(2), pages 230-235, April.
    5. Leyvand, Yaron & Shabtay, Dvir & Steiner, George, 2010. "A unified approach for scheduling with convex resource consumption functions using positional penalties," European Journal of Operational Research, Elsevier, vol. 206(2), pages 301-312, October.
    6. J-G Kim & D-H Lee, 2009. "Algorithms for common due-date assignment and sequencing on a single machine with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1264-1272, September.
    7. Zhi-Long Chen, 1997. "Scheduling with batch setup times and earliness-tardiness penalties," European Journal of Operational Research, Elsevier, vol. 96(3), pages 518-537, February.
    8. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
    9. S.S. Panwalkar & Christos Koulamas, 2015. "On equivalence between the proportionate flow shop and single‐machine scheduling problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(7), pages 595-603, October.
    10. T C E Cheng & L Kang & C T Ng, 2004. "Due-date assignment and single machine scheduling with deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 198-203, February.
    11. Yunqiang Yin & Doudou Li & Dujuan Wang & T. C. E. Cheng, 2021. "Single-machine serial-batch delivery scheduling with two competing agents and due date assignment," Annals of Operations Research, Springer, vol. 298(1), pages 497-523, March.
    12. Enrique Gerstl & Gur Mosheiov, 2013. "Minmax due-date assignment with a time window for acceptable lead-times," Annals of Operations Research, Springer, vol. 211(1), pages 167-177, December.
    13. Qian, Jianbo & Steiner, George, 2013. "Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine," European Journal of Operational Research, Elsevier, vol. 225(3), pages 547-551.
    14. Biskup, Dirk, 1999. "Single-machine scheduling with learning considerations," European Journal of Operational Research, Elsevier, vol. 115(1), pages 173-178, May.
    15. Chen, Zhi-Long, 1996. "Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs," European Journal of Operational Research, Elsevier, vol. 93(1), pages 49-60, August.
    16. Lin, Shih-Wei & Chou, Shuo-Yan & Ying, Kuo-Ching, 2007. "A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date," European Journal of Operational Research, Elsevier, vol. 177(2), pages 1294-1301, March.
    17. Baruch Mor, 2019. "Minmax scheduling problems with common due-date and completion time penalty," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 50-71, July.
    18. Koulamas, Christos & Gupta, Sushil & Kyparisis, George J., 2010. "A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times," European Journal of Operational Research, Elsevier, vol. 205(2), pages 479-482, September.
    19. Huynh Tuong, Nguyen & Soukhal, Ameur, 2010. "Due dates assignment and JIT scheduling with equal-size jobs," European Journal of Operational Research, Elsevier, vol. 205(2), pages 280-289, September.
    20. Biskup, Dirk & Jahnke, Hermann, 2001. "Common due date assignment for scheduling on a single machine with jointly reducible processing times," International Journal of Production Economics, Elsevier, vol. 69(3), pages 317-322, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:proeco:v:123:y:2010:i:1:p:235-242. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.