IDEAS home Printed from https://ideas.repec.org/p/hal/wpaper/hal-00877036.html
   My bibliography  Save this paper

The two-machine ow-shop serial-batching scheduling problem with limited batch size

Author

Listed:
  • Mohamed Ali Aloulou

    (LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision - Université Paris Dauphine-PSL - PSL - Université Paris Sciences et Lettres - CNRS - Centre National de la Recherche Scientifique)

  • Afef Bouzaiene

    (LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision - Université Paris Dauphine-PSL - PSL - Université Paris Sciences et Lettres - CNRS - Centre National de la Recherche Scientifique, OASIS - Optimisation des systèmes industriels et de services [Tunis] - ENIT - Ecole Nationale d'Ingénieurs de Tunis - UTM - Université de Tunis El Manar)

  • Najoua Dridi

    (ENIT - Ecole Nationale d'Ingénieurs de Tunis - UTM - Université de Tunis El Manar)

  • Daniel Vanderpooten

    (LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision - Université Paris Dauphine-PSL - PSL - Université Paris Sciences et Lettres - CNRS - Centre National de la Recherche Scientifique)

Abstract

We consider the the two-machine ow-shop serial-batching scheduling problem where the batches have limited size. Two criteria are considered here. The rst criterion is to minimize the number of batches. This criterion re ects situations where processing of any batch induces a xed cost, which leads to a total cost proportional to the number of batches. The second criterion is the makespan. We study the complexity of the problem and propose polynomial-time algorithms for some particular cases and an approximation algorithm with a guaranteed performance for the general case.

Suggested Citation

  • Mohamed Ali Aloulou & Afef Bouzaiene & Najoua Dridi & Daniel Vanderpooten, 2009. "The two-machine ow-shop serial-batching scheduling problem with limited batch size," Working Papers hal-00877036, HAL.
    • Handle: RePEc:hal:wpaper:hal-00877036
    Note: View the original document on HAL open archive server: https://hal.science/hal-00877036
    as

    Download full text from publisher

    File URL: https://hal.science/hal-00877036/document
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yuan, J.J. & Lin, Y.X. & Cheng, T.C.E. & Ng, C.T., 2007. "Single machine serial-batching scheduling problem with a common batch size to minimize total weighted completion time," International Journal of Production Economics, Elsevier, vol. 105(2), pages 402-406, February.
    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. Jun-Qiang Wang & Guo-Qiang Fan & Zhixin Liu, 2020. "Mixed batch scheduling on identical machines," Journal of Scheduling, Springer, vol. 23(4), pages 487-496, August.
    2. Gur Mosheiov & Daniel Oron, 2023. "A note on batch scheduling on a two-machine flowshop with machine-dependent processing times," 4OR, Springer, vol. 21(3), pages 457-469, September.
    3. 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.
    4. 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.
    5. Otto, Alena & Li, Xiyu, 2020. "Product sequencing in multiple-piece-flow assembly lines," Omega, Elsevier, vol. 91(C).
    6. Baoyu Liao & Qingru Song & Jun Pei & Shanlin Yang & Panos M. Pardalos, 2020. "Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration," Journal of Global Optimization, Springer, vol. 78(4), pages 717-742, December.
    7. Wenhua Li & Jinjiang Yuan & Yixun Lin, 2007. "A note on special optimal batching structures to minimize total weighted completion time," Journal of Combinatorial Optimization, Springer, vol. 14(4), pages 475-480, November.
    8. Yon-Chun Chou & Yue-Lan Lin & King-Fai Chun, 2016. "A method for aligning serial batching decisions in a two-level organization of factory and distributed workstations," Journal of Intelligent Manufacturing, Springer, vol. 27(6), pages 1287-1297, 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:hal:wpaper:hal-00877036. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.