IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v228y2013i2p345-357.html
   My bibliography  Save this article

Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains

Author

Listed:
  • Rasti-Barzoki, Morteza
  • Hejazi, Seyed Reza

Abstract

In this paper, an integrated due date assignment and production and batch delivery scheduling problem for make-to-order production system and multiple customers is addressed. Consider a supply chain scheduling problem in which n orders (jobs) have to be scheduled on a single machine and delivered to K customers or to other machines for further processing in batches. A common due date is assigned to all the jobs of each customer and the number of jobs in delivery batches is constrained by the batch size. The objective is to minimize the sum of the total weighted number of tardy jobs, the total due date assignment costs and the total batch delivery costs. The problem is NP-hard. We formulate the problem as an Integer Programming (IP) model. Also, in this paper, a Heuristic Algorithm (HA) and a Branch and Bound (B&B) method for solving this problem are presented. Computational tests are used to demonstrate the efficiency of the developed methods.

Suggested Citation

  • Rasti-Barzoki, Morteza & Hejazi, Seyed Reza, 2013. "Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains," European Journal of Operational Research, Elsevier, vol. 228(2), pages 345-357.
    • Handle: RePEc:eee:ejores:v:228:y:2013:i:2:p:345-357
    DOI: 10.1016/j.ejor.2013.01.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221713000118
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2013.01.002?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Slotnick, Susan A. & Sobel, Matthew J., 2005. "Manufacturing lead-time rules: Customer retention versus tardiness costs," European Journal of Operational Research, Elsevier, vol. 163(3), pages 825-856, June.
    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. 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.
    4. Nicholas G. Hall & Chris N. Potts, 2003. "Supply chain scheduling: Batching and delivery," Operations Research, INFORMS, vol. 51(4), pages 566-584, August.
    5. George Steiner & Rui Zhang, 2011. "Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries," Annals of Operations Research, Springer, vol. 191(1), pages 171-181, November.
    6. Zhi-Long Chen & Guruprasad Pundoor, 2006. "Order Assignment and Scheduling in a Supply Chain," Operations Research, INFORMS, vol. 54(3), pages 555-572, June.
    7. M'Hallah, Rym & Bulfin, R.L., 2007. "Minimizing the weighted number of tardy jobs on a single machine with release dates," European Journal of Operational Research, Elsevier, vol. 176(2), pages 727-744, January.
    8. Zhi-Long Chen, 2010. "Integrated Production and Outbound Distribution Scheduling: Review and Extensions," Operations Research, INFORMS, vol. 58(1), pages 130-148, February.
    9. Braune, R. & Zäpfel, G. & Affenzeller, M., 2012. "An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective," European Journal of Operational Research, Elsevier, vol. 218(1), pages 76-85.
    10. J. Michael Moore, 1968. "An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs," Management Science, INFORMS, vol. 15(1), pages 102-109, September.
    11. Jouglet, Antoine & Carlier, Jacques, 2011. "Dominance rules in combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 212(3), pages 433-444, August.
    12. Thomas, Douglas J. & Griffin, Paul M., 1996. "Coordinated supply chain management," European Journal of Operational Research, Elsevier, vol. 94(1), pages 1-15, October.
    13. M'Hallah, Rym & Bulfin, R. L., 2003. "Minimizing the weighted number of tardy jobs on a single machine," European Journal of Operational Research, Elsevier, vol. 145(1), pages 45-56, February.
    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. Janiak, Adam & Janiak, Władysław A. & Krysiak, Tomasz & Kwiatkowski, Tomasz, 2015. "A survey on scheduling problems with due windows," European Journal of Operational Research, Elsevier, vol. 242(2), pages 347-357.
    2. Chen, Ke & Cheng, T.C.E. & Huang, Hailiang & Ji, Min & Yao, Danli, 2023. "Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 309(1), pages 24-34.
    3. Sun, X.T. & Chung, S.H. & Chan, Felix T.S. & Wang, Zheng, 2018. "The impact of liner shipping unreliability on the production–distribution scheduling of a decentralized manufacturing system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 242-269.
    4. Zeynep Ceylan & Hakan Tozan & Serol Bulkan, 2021. "A coordinated scheduling problem for the supply chain in a flexible job shop machine environment," Operational Research, Springer, vol. 21(2), pages 875-900, June.

    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. Ullrich, Christian A., 2013. "Integrated machine scheduling and vehicle routing with time windows," European Journal of Operational Research, Elsevier, vol. 227(1), pages 152-165.
    2. Gao, Su & Qi, Lian & Lei, Lei, 2015. "Integrated batch production and distribution scheduling with limited vehicle capacity," International Journal of Production Economics, Elsevier, vol. 160(C), pages 13-25.
    3. George Steiner & Rui Zhang, 2011. "Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries," Annals of Operations Research, Springer, vol. 191(1), pages 171-181, November.
    4. Liang Tang & Zhihong Jin & Xuwei Qin & Ke Jing, 2019. "Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design," Annals of Operations Research, Springer, vol. 275(2), pages 685-714, April.
    5. Esaignani Selvarajah & Rui Zhang, 2014. "Supply chain scheduling to minimize holding costs with outsourcing," Annals of Operations Research, Springer, vol. 217(1), pages 479-490, June.
    6. Zhong, Xueling & Fan, Jie & Ou, Jinwen, 2022. "Coordinated scheduling of the outsourcing, in-house production and distribution operations," European Journal of Operational Research, Elsevier, vol. 302(2), pages 427-437.
    7. Sachchida Nand Chaurasia & Shyam Sundar & Alok Singh, 2017. "Hybrid metaheuristic approaches for the single machine total stepwise tardiness problem with release dates," Operational Research, Springer, vol. 17(1), pages 275-295, April.
    8. Nicholas G. Hall & Zhixin Liu, 2010. "Capacity Allocation and Scheduling in Supply Chains," Operations Research, INFORMS, vol. 58(6), pages 1711-1725, December.
    9. Lixin Tang & Feng Li & Jiyin Liu, 2015. "Integrated scheduling of loading and transportation with tractors and semitrailers separated," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(5), pages 416-433, August.
    10. Tülin İnkaya & Mehmet Akansel, 2017. "Coordinated scheduling of the transfer lots in an assembly-type supply chain: a genetic algorithm approach," Journal of Intelligent Manufacturing, Springer, vol. 28(4), pages 1005-1015, April.
    11. 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.
    12. Agnetis, Alessandro & Aloulou, Mohamed Ali & Fu, Liang-Liang, 2014. "Coordination of production and interstage batch delivery with outsourced distribution," European Journal of Operational Research, Elsevier, vol. 238(1), pages 130-142.
    13. Koulamas, Christos, 2011. "A unified solution approach for the due date assignment problem with tardy jobs," International Journal of Production Economics, Elsevier, vol. 132(2), pages 292-295, August.
    14. Cheng, Ba-Yi & Leung, Joseph Y-T. & Li, Kai, 2017. "Integrated scheduling on a batch machine to minimize production, inventory and distribution costs," European Journal of Operational Research, Elsevier, vol. 258(1), pages 104-112.
    15. Sawik, Tadeusz, 2009. "Coordinated supply chain scheduling," International Journal of Production Economics, Elsevier, vol. 120(2), pages 437-451, August.
    16. 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.
    17. B.‐Y. Cheng & J.Y.‐T. Leung & K. Li & S.‐L. Yang, 2015. "Single batch machine scheduling with deliveries," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(6), pages 470-482, September.
    18. Feng Li & Zhou Xu & Zhi-Long Chen, 2020. "Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1012-1029, October.
    19. Lixin Tang & Feng Li & Zhi-Long Chen, 2019. "Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 493-514, July.
    20. Janiak, Adam & Janiak, Władysław A. & Krysiak, Tomasz & Kwiatkowski, Tomasz, 2015. "A survey on scheduling problems with due windows," European Journal of Operational Research, Elsevier, vol. 242(2), pages 347-357.

    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:ejores:v:228:y:2013:i:2:p:345-357. 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/eor .

    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.