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

Batch delivery scheduling with batch delivery cost on a single machine

Author

Listed:
  • Ji, Min
  • He, Yong
  • Cheng, T.C.E.

Abstract

No abstract is available for this item.

Suggested Citation

  • Ji, Min & He, Yong & Cheng, T.C.E., 2007. "Batch delivery scheduling with batch delivery cost on a single machine," European Journal of Operational Research, Elsevier, vol. 176(2), pages 745-755, January.
    • Handle: RePEc:eee:ejores:v:176:y:2007:i:2:p:745-755
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00697-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. E. L. Lawler & J. M. Moore, 1969. "A Functional Equation and its Application to Resource Allocation and Sequencing Problems," Management Science, INFORMS, vol. 16(1), pages 77-84, September.
    2. 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.
    3. Michael H. Rothkopf, 1966. "Scheduling Independent Tasks on Parallel Processors," Management Science, INFORMS, vol. 12(5), pages 437-447, January.
    4. 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.
    5. Edward G. Coffman & Ardavan Nozari & Mihalis Yannakakis, 1989. "Optimal Scheduling of Products with Two Subassemblies on a Single Machine," Operations Research, INFORMS, vol. 37(3), pages 426-436, June.
    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. Mohammad Rostami & Milad Mohammadi, 2024. "Two-machine decentralized flow shop scheduling problem with inter-factory batch delivery system," Operational Research, Springer, vol. 24(3), pages 1-37, September.
    2. 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.
    3. 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.
    4. 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.
    5. Mohammad Rostami & Shiva Nikravesh & Mahdi Shahin, 2020. "Minimizing total weighted completion and batch delivery times with machine deterioration and learning effect: a case study from wax production," Operational Research, Springer, vol. 20(3), pages 1255-1287, September.
    6. Zhi-Long Chen, 2010. "Integrated Production and Outbound Distribution Scheduling: Review and Extensions," Operations Research, INFORMS, vol. 58(1), pages 130-148, February.
    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. Deyun Wang & Olivier Grunder & Abdellah EL Moudni, 2014. "Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations," International Journal of Systems Science, Taylor & Francis Journals, vol. 45(8), pages 1694-1707, August.
    9. Ji, Min & Cheng, T.C.E., 2010. "Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan," European Journal of Operational Research, Elsevier, vol. 202(1), pages 90-98, April.

    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. Mor, Baruch & Mosheiov, Gur, 2014. "Batch scheduling with a rate-modifying maintenance activity to minimize total flowtime," International Journal of Production Economics, Elsevier, vol. 153(C), pages 238-242.
    2. 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.
    3. 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.
    4. Huynh Tuong, Nguyen & Soukhal, Ameur & Billaut, Jean-Charles, 2010. "A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines," European Journal of Operational Research, Elsevier, vol. 202(3), pages 646-653, May.
    5. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1980. "An Introduction To Multiprocessor Scheduling," Econometric Institute Archives 272258, Erasmus University Rotterdam.
    6. Maliheh Ganji & Rahmat Rabet & Seyed Mojtaba Sajadi, 2022. "A new coordinating model for green supply chain and batch delivery scheduling with satisfaction customers," Environment, Development and Sustainability: A Multidisciplinary Approach to the Theory and Practice of Sustainable Development, Springer, vol. 24(4), pages 4566-4601, April.
    7. Jae-Min Yu & Rong Huang & Dong-Ho Lee, 2017. "Iterative algorithms for batching and scheduling to minimise the total job tardiness in two-stage hybrid flow shops," International Journal of Production Research, Taylor & Francis Journals, vol. 55(11), pages 3266-3282, June.
    8. 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.
    9. Zhi-Long Chen, 2010. "Integrated Production and Outbound Distribution Scheduling: Review and Extensions," Operations Research, INFORMS, vol. 58(1), pages 130-148, February.
    10. Zhi-Long Chen & Guruprasad Pundoor, 2006. "Order Assignment and Scheduling in a Supply Chain," Operations Research, INFORMS, vol. 54(3), pages 555-572, June.
    11. Dunstall, Simon & Wirth, Andrew, 2005. "A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines," European Journal of Operational Research, Elsevier, vol. 167(2), pages 283-296, December.
    12. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    13. Azizoglu, Meral & Kirca, Omer, 1999. "On the minimization of total weighted flow time with identical and uniform parallel machines," European Journal of Operational Research, Elsevier, vol. 113(1), pages 91-100, February.
    14. 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.
    15. Daniel Kowalczyk & Roel Leus, 2018. "A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 768-782, November.
    16. Ji, Min & Cheng, T.C.E., 2010. "Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan," European Journal of Operational Research, Elsevier, vol. 202(1), pages 90-98, April.
    17. Potts, Chris N. & Kovalyov, Mikhail Y., 2000. "Scheduling with batching: A review," European Journal of Operational Research, Elsevier, vol. 120(2), pages 228-249, January.
    18. 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.
    19. Liji Shen & Lars Mönch & Udo Buscher, 2013. "An iterative approach for the serial batching problem with parallel machines and job families," Annals of Operations Research, Springer, vol. 206(1), pages 425-448, July.
    20. 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.

    More about this item

    Statistics

    Access and download statistics

    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:176:y:2007:i:2:p:745-755. 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.