IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v21y2018i3d10.1007_s10951-017-0508-2.html
   My bibliography  Save this article

Single machine scheduling with job delivery to multiple customers

Author

Listed:
  • Jianming Dong

    (Zhejiang Sci-Tech University)

  • Xueshi Wang

    (Zhejiang Sci-Tech University)

  • Jueliang Hu

    (Zhejiang Sci-Tech University)

  • Guohui Lin

    (Zhejiang Sci-Tech University
    University of Alberta)

Abstract

We investigate a single machine scheduling problem with job delivery to multiple customers. In this problem, each job needs to be processed on the single machine, and then delivered by a single vehicle to its customer, where the job has a physical size representing the fraction of space it occupies on the vehicle. The vehicle delivers a shipment from the machine to a customer and has to return back to the machine for delivering the next shipment. It takes different constant time for the round trips between the machine and the different customers. The goal is to minimize the makespan, by that time all the jobs are processed and delivered to their respective customers, and the vehicle returns back to the machine. We propose a 2-approximation algorithm for the general case; when there are only two customers, we present an improved 5/3-approximation algorithm. The design and performance analysis of these two algorithms integrate several known results and techniques for the single machine scheduling problem, the bin-packing problem, and the knapsack problem.

Suggested Citation

  • Jianming Dong & Xueshi Wang & Jueliang Hu & Guohui Lin, 2018. "Single machine scheduling with job delivery to multiple customers," Journal of Scheduling, Springer, vol. 21(3), pages 337-348, June.
    • Handle: RePEc:spr:jsched:v:21:y:2018:i:3:d:10.1007_s10951-017-0508-2
    DOI: 10.1007/s10951-017-0508-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-017-0508-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-017-0508-2?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. Zhong, Weiya & Dosa, Gyorgy & Tan, Zhiyi, 2007. "On the machine scheduling problem with job delivery coordination," European Journal of Operational Research, Elsevier, vol. 182(3), pages 1057-1072, November.
    2. Lingfa Lu & Jinjiang Yuan, 2008. "Single Machine Scheduling With Job Delivery To Minimize Makespan," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 25(01), pages 1-10.
    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. Jinjiang Yuan & Lei Shi & Jinwen Ou, 2008. "Single Machine Scheduling With Forbidden Intervals And Job Delivery Times," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 25(03), pages 317-325.
    Full references (including those not matched with items on IDEAS)

    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. Söhnke Maecker & Liji Shen, 2020. "Solving parallel machine problems with delivery times and tardiness objectives," Annals of Operations Research, Springer, vol. 285(1), pages 315-334, February.
    2. Low, Chinyao & Chang, Chien-Min & Li, Rong-Kwei & Huang, Chia-Ling, 2014. "Coordination of production scheduling and delivery problems with heterogeneous fleet," International Journal of Production Economics, Elsevier, vol. 153(C), pages 139-148.
    3. Liu, Peihai & Lu, Xiwen, 2016. "Integrated production and job delivery scheduling with an availability constraint," International Journal of Production Economics, Elsevier, vol. 176(C), pages 1-6.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. Guo, Zhaoxia & Shi, Leyuan & Chen, Longchao & Liang, Yong, 2017. "A harmony search-based memetic optimization model for integrated production and transportation scheduling in MTO manufacturing," Omega, Elsevier, vol. 66(PB), pages 327-343.
    11. Zhi-Long Chen, 2010. "Integrated Production and Outbound Distribution Scheduling: Review and Extensions," Operations Research, INFORMS, vol. 58(1), pages 130-148, February.
    12. Jianming Dong & Xueshi Wang & Jueliang Hu & Guohui Lin, 2016. "An improved two-machine flowshop scheduling with intermediate transportation," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 1316-1334, April.
    13. 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.
    14. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    15. 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.
    16. Azeddine Cheref & Alessandro Agnetis & Christian Artigues & Jean-Charles Billaut, 2017. "Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence," Journal of Scheduling, Springer, vol. 20(6), pages 681-693, December.
    17. 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.
    18. Han, Bin & Zhang, Wenjun & Lu, Xiwen & Lin, Yingzi, 2015. "On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: Minimizing the makespan and delivery cost," European Journal of Operational Research, Elsevier, vol. 244(3), pages 704-714.
    19. Ji Tian & Yan Zhou & Ruyan Fu, 2020. "An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 170-180, July.
    20. Zhong, Weiya & Dosa, Gyorgy & Tan, Zhiyi, 2007. "On the machine scheduling problem with job delivery coordination," European Journal of Operational Research, Elsevier, vol. 182(3), pages 1057-1072, November.

    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:spr:jsched:v:21:y:2018:i:3:d:10.1007_s10951-017-0508-2. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.