IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v38y2010i6p509-521.html
   My bibliography  Save this article

Coordinated scheduling of production and delivery stages with stage-dependent inventory holding costs

Author

Listed:
  • Sun Lee, Ik
  • Yoon, S.H.

Abstract

This paper considers a problem of integrated decision-making for job scheduling and delivery batching wherein different inventory holding costs between production and delivery stages are allowed. In the problem, jobs are processed on a facility at a production stage and then delivered at the subsequent delivery stage by a capacitated vehicle. The objective is to find the coordinated schedule of production and delivery that minimizes the total cost of the associated WIP inventory, finished product inventory and delivery, where both the inventory costs are characterized in terms of the weighted flow-time and the delivery cost is proportional to the required number of delivery batches. It is proved that the problem is NP-hard in the strong sense. Thereupon, three heuristic algorithms are derived. Some restricted cases are also characterized as being solvable in polynomial time. Numerical experiments are conducted to evaluate the performance of the derived heuristic algorithms.

Suggested Citation

  • Sun Lee, Ik & Yoon, S.H., 2010. "Coordinated scheduling of production and delivery stages with stage-dependent inventory holding costs," Omega, Elsevier, vol. 38(6), pages 509-521, December.
    • Handle: RePEc:eee:jomega:v:38:y:2010:i:6:p:509-521
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(10)00002-2
    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. Yan, Shangyao & Tang, Ching-Hui, 2009. "Inter-city bus scheduling under variable market share and uncertain market demands," Omega, Elsevier, vol. 37(1), pages 178-192, February.
    2. 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.
    3. Day, Jamison M. & Daniel Wright, P. & Schoenherr, Tobias & Venkataramanan, Munirpallam & Gaudette, Kevin, 2009. "Improving routing and scheduling decisions at a distributor of industrial gasses," Omega, Elsevier, vol. 37(1), pages 227-237, February.
    4. Li, Chung-Lun & Vairaktarakis, George & Lee, Chung-Yee, 2005. "Machine scheduling with deliveries to multiple customer locations," European Journal of Operational Research, Elsevier, vol. 164(1), pages 39-51, July.
    5. Cheng, T. C. Edwin & Gordon, Valery S. & Kovalyov, Mikhail Y., 1996. "Single machine scheduling with batch deliveries," European Journal of Operational Research, Elsevier, vol. 94(2), pages 277-283, October.
    6. Leslie A. Hall & David B. Shmoys, 1992. "Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better," Mathematics of Operations Research, INFORMS, vol. 17(1), pages 22-35, February.
    7. Lin, B.M.T. & Cheng, T.C.E. & Chou, A.S.C., 2007. "Scheduling in an assembly-type production chain with batch transfer," Omega, Elsevier, vol. 35(2), pages 143-151, April.
    8. Javad H. Ahmadi & Reza H. Ahmadi & Sriram Dasu & Christopher S. Tang, 1992. "Batching and Scheduling Jobs on Batch and Discrete Processors," Operations Research, INFORMS, vol. 40(4), pages 750-763, August.
    9. Nicholas G. Hall & 'Maseka Lesaoana & Chris N. Potts, 2001. "Scheduling with Fixed Delivery Dates," Operations Research, INFORMS, vol. 49(1), pages 134-144, February.
    10. Chang, Yung-Chia & Lee, Chung-Yee, 2004. "Machine scheduling with job delivery coordination," European Journal of Operational Research, Elsevier, vol. 158(2), pages 470-487, October.
    11. Yuan, Jinjiang, 1996. "A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs," European Journal of Operational Research, Elsevier, vol. 94(1), pages 203-205, October.
    12. Sup Sung, Chang & Hwan Kim, Young, 2003. "Minimizing due date related performance measures on two batch processing machines," European Journal of Operational Research, Elsevier, vol. 147(3), pages 644-656, June.
    13. Nicholas G. Hall & Chris N. Potts, 2003. "Supply chain scheduling: Batching and delivery," Operations Research, INFORMS, vol. 51(4), pages 566-584, August.
    14. C. N. Potts, 1980. "Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times," Operations Research, INFORMS, vol. 28(6), pages 1436-1441, December.
    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.
    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. Zhen Wang & Qianwang Deng & Like Zhang & Xiaoyan Liu, 2023. "Integrated scheduling of production, inventory and imperfect maintenance based on mutual feedback of supplier and demander in distributed environment," Journal of Intelligent Manufacturing, Springer, vol. 34(8), pages 3445-3467, December.
    2. 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.
    3. Sağlam, Ümit & Banerjee, Avijit, 2018. "Integrated multiproduct batch production and truck shipment scheduling under different shipping policies," Omega, Elsevier, vol. 74(C), pages 70-81.
    4. Berghman, Lotte & Kergosien, Yannick & Billaut, Jean-Charles, 2023. "A review on integrated scheduling and outbound vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 311(1), pages 1-23.
    5. Sterna, Malgorzata, 2011. "A survey of scheduling problems with late work criteria," Omega, Elsevier, vol. 39(2), pages 120-129, April.
    6. Kopanos, Georgios M. & Puigjaner, Luis & Georgiadis, Michael C., 2012. "Simultaneous production and logistics operations planning in semicontinuous food industries," Omega, Elsevier, vol. 40(5), pages 634-650.

    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. Zhi-Long Chen, 2010. "Integrated Production and Outbound Distribution Scheduling: Review and Extensions," Operations Research, INFORMS, vol. 58(1), pages 130-148, February.
    2. 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.
    3. Chang, Yung-Chia & Lee, Chung-Yee, 2004. "Machine scheduling with job delivery coordination," European Journal of Operational Research, Elsevier, vol. 158(2), pages 470-487, October.
    4. Zhi-Long Chen & George L. Vairaktarakis, 2005. "Integrated Scheduling of Production and Distribution Operations," Management Science, INFORMS, vol. 51(4), pages 614-628, April.
    5. Guruprasad Pundoor & Zhi‐Long Chen, 2005. "Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 571-589, September.
    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. Xiangtong Qi, 2005. "A logistics scheduling model: Inventory cost reduction by batching," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(4), pages 312-320, June.
    8. Esaignani Selvarajah & George Steiner, 2009. "Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs," Operations Research, INFORMS, vol. 57(2), pages 426-438, April.
    9. Chen, Bo & Lee, Chung-Yee, 2008. "Logistics scheduling with batching and transportation," European Journal of Operational Research, Elsevier, vol. 189(3), pages 871-876, September.
    10. Kathryn E. Stecke & Xuying Zhao, 2007. "Production and Transportation Integration for a Make-to-Order Manufacturing Company with a Commit-to-Delivery Business Mode," Manufacturing & Service Operations Management, INFORMS, vol. 9(2), pages 206-224, September.
    11. 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.
    12. Wang, Guoqing & Cheng, T. C. Edwin, 2000. "Parallel machine scheduling with batch delivery costs," International Journal of Production Economics, Elsevier, vol. 68(2), pages 177-183, November.
    13. Yinling Wang & Yan Lan & Xin Chen & Xin Han & Yong Piao, 0. "A tight approximation algorithm for problem $$P2\rightarrow D|v=1,c=1|C_{\max }$$P2→D|v=1,c=1|Cmax," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-12.
    14. Ronald Armstrong & Su Gao & Lei Lei, 2008. "A zero-inventory production and distribution problem with a fixed customer sequence," Annals of Operations Research, Springer, vol. 159(1), pages 395-414, March.
    15. 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.
    16. Ali Gharaei & Fariborz Jolai, 2021. "A Pareto approach for the multi-factory supply chain scheduling and distribution problem," Operational Research, Springer, vol. 21(4), pages 2333-2364, December.
    17. Yinling Wang & Yan Lan & Xin Chen & Xin Han & Yong Piao, 2022. "A tight approximation algorithm for problem $$P2\rightarrow D|v=1,c=1|C_{\max }$$ P 2 → D | v = 1 , c = 1 | C max," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2195-2206, November.
    18. Jason Pan & Chi-Shiang Su, 2015. "Two parallel machines problem with job delivery coordination and availability constraint," Annals of Operations Research, Springer, vol. 235(1), pages 653-664, December.
    19. Wan, Long & Zhang, An, 2014. "Coordinated scheduling on parallel machines with batch delivery," International Journal of Production Economics, Elsevier, vol. 150(C), pages 199-203.
    20. 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.

    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:jomega:v:38:y:2010:i:6:p:509-521. 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/wps/find/journaldescription.cws_home/375/description#description .

    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.