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

Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families

Author

Listed:
  • Yang, Fan
  • Davari, Morteza
  • Wei, Wenchao
  • Hermans, Ben
  • Leus, Roel

Abstract

We study the scheduling of jobs on a single parallel-batching machine with non-identical job sizes and incompatible job families. Jobs from the same family have the same processing time and can be loaded into a batch, as long as the batch size respects the machine capacity. The objective is to minimize the total weighted completion time; this common scheduling objective is equivalent with the minimization of in-process inventory when all jobs have the same release date. Our problem combines two classic combinatorial problems, namely bin packing and single machine scheduling. We develop three new mixed-integer linear-programming formulations, namely an assignment-based formulation, a time-indexed formulation (TIF), and a set-partitioning formulation (SPF). We also propose a column generation (CG) algorithm for the SPF, a branch-and-price (B&P) algorithm and a CG-based heuristic. A heuristic framework based on proximity search is also developed using the TIF. We examine how to reduce the size (number of variables) of the formulations in a preprocessing step. The SPF and B&P can solve instances with non-unit and unit job durations to optimality with up to 80 and 150 jobs within reasonable runtime limits, respectively. The proposed heuristics perform better than the methods available in the literature for the same problem.

Suggested Citation

  • Yang, Fan & Davari, Morteza & Wei, Wenchao & Hermans, Ben & Leus, Roel, 2022. "Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families," European Journal of Operational Research, Elsevier, vol. 303(2), pages 602-615.
    • Handle: RePEc:eee:ejores:v:303:y:2022:i:2:p:602-615
    DOI: 10.1016/j.ejor.2022.03.027
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722172200251X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2022.03.027?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. Gregory Dobson & Ramakrishnan S. Nambimadom, 2001. "The Batch Loading and Scheduling Problem," Operations Research, INFORMS, vol. 49(1), pages 52-65, February.
    2. Koh, Shie-Gheun & Koo, Pyung-Hoi & Kim, Dong-Chun & Hur, Won-Suk, 2005. "Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families," International Journal of Production Economics, Elsevier, vol. 98(1), pages 81-96, October.
    3. Jun Pei & Bayi Cheng & Xinbao Liu & Panos M. Pardalos & Min Kong, 2019. "Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time," Annals of Operations Research, Springer, vol. 272(1), pages 217-241, January.
    4. Ruslan Sadykov & François Vanderbeck, 2013. "Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 244-255, May.
    5. A H Kashan & B Karimi, 2008. "Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(9), pages 1269-1280, September.
    6. Shen, Liji & Buscher, Udo, 2012. "Solving the serial batching problem in job shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 14-26.
    7. Ozturk, Onur, 2020. "A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time," European Journal of Operational Research, Elsevier, vol. 286(2), pages 432-443.
    8. Wayne E. Smith, 1956. "Various optimizers for single‐stage production," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 59-66, March.
    9. Kameng Nip & Zhenbo Wang & Fabrice Talla Nobibon & Roel Leus, 2015. "A combination of flow shop scheduling and the shortest path problem," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 36-52, January.
    10. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    11. A. Alfieri & A. Druetto & A. Grosso & F. Salassa, 2021. "Column generation for minimizing total completion time in a parallel-batching environment," Journal of Scheduling, Springer, vol. 24(6), pages 569-588, December.
    12. 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.
    13. Ozturk, Onur & Begen, Mehmet A. & Zaric, Gregory S., 2014. "A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services," European Journal of Operational Research, Elsevier, vol. 239(1), pages 214-226.
    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. Tian, Zheng & Zheng, Li, 2024. "Single machine parallel-batch scheduling under time-of-use electricity prices: New formulations and optimisation approaches," European Journal of Operational Research, Elsevier, vol. 312(2), pages 512-524.
    2. Lin, Ran & Wang, Jun-Qiang & Liu, Zhixin & Xu, Jun, 2023. "Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions," European Journal of Operational Research, Elsevier, vol. 309(1), pages 53-64.

    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. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    2. Alessandro Druetto & Erica Pastore & Elena Rener, 2023. "Parallel batching with multi-size jobs and incompatible job families," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(2), pages 440-458, July.
    3. Husseinzadeh Kashan, Ali & Ozturk, Onur, 2022. "Improved MILP formulation equipped with valid inequalities for scheduling a batch processing machine with non-identical job sizes," Omega, Elsevier, vol. 112(C).
    4. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    5. Maxence Delorme & Manuel Iori, 2020. "Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 101-119, January.
    6. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    7. Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
    8. Renatha Capua & Yuri Frota & Luiz Satoru Ochi & Thibaut Vidal, 2018. "A study on exponential-size neighborhoods for the bin packing problem with conflicts," Journal of Heuristics, Springer, vol. 24(4), pages 667-695, August.
    9. Yuan Gao & Jinjiang Yuan, 2019. "Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 698-711, October.
    10. Mathijs Barkel & Maxence Delorme, 2023. "Arcflow Formulations and Constraint Generation Frameworks for the Two Bar Charts Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 35(2), pages 475-494, March.
    11. Ruslan Sadykov & François Vanderbeck & Artur Pessoa & Issam Tahiri & Eduardo Uchoa, 2019. "Primal Heuristics for Branch and Price: The Assets of Diving Methods," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 251-267, April.
    12. Orlando Rivera Letelier & François Clautiaux & Ruslan Sadykov, 2022. "Bin Packing Problem with Time Lags," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2249-2270, July.
    13. Tian, Zheng & Zheng, Li, 2024. "Single machine parallel-batch scheduling under time-of-use electricity prices: New formulations and optimisation approaches," European Journal of Operational Research, Elsevier, vol. 312(2), pages 512-524.
    14. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    15. Chakhlevitch, Konstantin & Glass, Celia A. & Kellerer, Hans, 2011. "Batch machine production with perishability time windows and limited batch size," European Journal of Operational Research, Elsevier, vol. 210(1), pages 39-47, April.
    16. Kramer, Arthur & Dell’Amico, Mauro & Iori, Manuel, 2019. "Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines," European Journal of Operational Research, Elsevier, vol. 275(1), pages 67-79.
    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. Kramer, Arthur & Iori, Manuel & Lacomme, Philippe, 2021. "Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization," European Journal of Operational Research, Elsevier, vol. 289(3), pages 825-840.
    19. Laub, Jeffrey D. & Fowler, John W. & Keha, Ahmet B., 2007. "Minimizing makespan with multiple-orders-per-job in a two-machine flowshop," European Journal of Operational Research, Elsevier, vol. 182(1), pages 63-79, October.
    20. Schepler, Xavier & Rossi, André & Gurevsky, Evgeny & Dolgui, Alexandre, 2022. "Solving robust bin-packing problems with a branch-and-price approach," European Journal of Operational Research, Elsevier, vol. 297(3), pages 831-843.

    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:303:y:2022:i:2:p:602-615. 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.