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

Online scheduling on parallel-batch machines with periodic availability constraints and job delivery

Author

Listed:
  • Lin, Ran
  • Wang, Jun-Qiang
  • Oulamara, Ammar

Abstract

We address an online scheduling problem on identical parallel-batch machines with periodic availability constraints and job delivery. A parallel-batch machine can process several jobs simultaneously in a batch without any preemption. The processing time of a batch is equal to the maximum processing time of the jobs in this batch, and the job processing times we consider are identical on all machines. Available and unavailable time intervals occur alternately on machines. The unavailable time intervals have the same start and end time on different machines. Jobs are released over time, which means that no information of the job is known in advance before its release date. After completion, job is delivered to customer. Three objective functions, namely, maximum flow time, maximum delivery time and total flow time are considered separately. For these objectives, we derive lower bounds on competitive ratios, provide online algorithms and analyze their competitive ratios.

Suggested Citation

  • Lin, Ran & Wang, Jun-Qiang & Oulamara, Ammar, 2023. "Online scheduling on parallel-batch machines with periodic availability constraints and job delivery," Omega, Elsevier, vol. 116(C).
    • Handle: RePEc:eee:jomega:v:116:y:2023:i:c:s0305048322002109
    DOI: 10.1016/j.omega.2022.102804
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048322002109
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2022.102804?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. Xing Chai & Wenhua Li & Yuejuan Zhu, 2021. "Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine," Annals of Operations Research, Springer, vol. 298(1), pages 79-93, March.
    2. Chengwen Jiao & Wenhua Li & Jinjiang Yuan, 2014. "A Best Possible Online Algorithm For Scheduling To Minimize Maximum Flow-Time On Bounded Batch Machines," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 31(04), pages 1-10.
    3. Peihai Liu & Xiwen Lu, 2015. "Online unbounded batch scheduling on parallel machines with delivery times," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 228-236, January.
    4. Jihene Kaabi & Youssef Harrath, 2019. "Scheduling on uniform parallel machines with periodic unavailability constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 57(1), pages 216-227, January.
    5. Chung-Yee Lee & Reha Uzsoy & Louis A. Martin-Vega, 1992. "Efficient Algorithms for Scheduling Semiconductor Burn-In Operations," Operations Research, INFORMS, vol. 40(4), pages 764-775, August.
    6. Yuan, Jinjiang & Qi, Xianglai & Lu, Lingfa & Li, Wenhua, 2008. "Single machine unbounded parallel-batch scheduling with forbidden intervals," European Journal of Operational Research, Elsevier, vol. 186(3), pages 1212-1217, May.
    7. Zhang, Jun & Wang, Xuping & Huang, Kai, 2018. "On-line scheduling of order picking and delivery with multiple zones and limited vehicle capacity," Omega, Elsevier, vol. 79(C), pages 104-115.
    8. 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.
    9. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    10. 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).
    11. 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.
    12. Pereira, Daniel Filipe & Oliveira, José Fernando & Carravilla, Maria Antónia, 2022. "Merging make-to-stock/make-to-order decisions into sales and operations planning: A multi-objective approach," Omega, Elsevier, vol. 107(C).
    13. Wang, Jun-Qiang & Leung, Joseph Y.-T., 2014. "Scheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan," International Journal of Production Economics, Elsevier, vol. 156(C), pages 325-331.
    14. Dorit S. Hochbaum & Dan Landy, 1997. "Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime," Operations Research, INFORMS, vol. 45(6), pages 874-885, December.
    15. Ran Lin & Wenhua Li & Xing Chai, 2021. "On-line scheduling with equal-length jobs on parallel-batch machines to minimise maximum flow-time with delivery times," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(8), pages 1754-1761, August.
    16. Jun-Qiang Wang & Fei-Yi Yan & Peng-Hao Cui & Chao-Bo Yan, 2019. "Bernoulli serial lines with batching machines: Performance analysis and system-theoretic properties," IISE Transactions, Taylor & Francis Journals, vol. 51(7), pages 729-743, July.
    17. Mosheiov, Gur & Sarig, Assaf & Strusevich, Vitaly A & Mosheiff, Jonathan, 2018. "Two-machine flow shop and open shop scheduling problems with a single maintenance window," European Journal of Operational Research, Elsevier, vol. 271(2), pages 388-400.
    18. 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.
    19. Chung-Lun Li, 2008. "A note on unrelated parallel machine scheduling with time-dependent processing times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(12), pages 1696-1697, December.
    20. Wang, Jun-Qiang & Fan, Guo-Qiang & Zhang, Yingqian & Zhang, Cheng-Wu & Leung, Joseph Y.-T., 2017. "Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes," European Journal of Operational Research, Elsevier, vol. 258(2), pages 478-490.
    21. Chung‐Yee Lee & Zhi‐Long Chen, 2000. "Scheduling jobs and maintenance activities on parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(2), pages 145-165, March.
    22. Bachtenkirch, David & Bock, Stefan, 2022. "Finding efficient make-to-order production and batch delivery schedules," European Journal of Operational Research, Elsevier, vol. 297(1), pages 133-152.
    23. 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.
    24. Zhao, Ruijia & Song, Yunting & Wang, Haoze & Xie, Xinlian, 2022. "Bi-objective optimisation model and its exact solution method of profit and market share of novel repair-and-support ships based on game theory," Omega, Elsevier, vol. 113(C).
    25. 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.
    26. Chung Keung Poon & Wenci Yu, 2005. "On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity," Journal of Combinatorial Optimization, Springer, vol. 9(2), pages 167-186, March.
    27. Gouchuan Zhang & Xiaoqiang Cai & C.K. Wong, 2001. "On‐line algorithms for minimizing makespan on batch processing machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(3), pages 241-258, April.
    28. Kay Peeters & Henny van Ooijen, 2020. "Hybrid make-to-stock and make-to-order systems: a taxonomic review," International Journal of Production Research, Taylor & Francis Journals, vol. 58(15), pages 4659-4688, July.
    29. Yin, Yunqiang & Wang, Yan & Cheng, T.C.E. & Liu, Wenqi & Li, Jinhai, 2017. "Parallel-machine scheduling of deteriorating jobs with potential machine disruptions," Omega, Elsevier, vol. 69(C), pages 17-28.
    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. 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. 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.
    2. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    3. 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.
    4. 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.
    5. Li, Kai & Jia, Zhao-hong & Leung, Joseph Y.-T., 2015. "Integrated production and delivery on parallel batching machines," European Journal of Operational Research, Elsevier, vol. 247(3), pages 755-763.
    6. Yang Fang & Peihai Liu & Xiwen Lu, 2011. "Optimal on-line algorithms for one batch machine with grouped processing times," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 509-516, November.
    7. Melouk, Sharif & Damodaran, Purushothaman & Chang, Ping-Yu, 2004. "Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing," International Journal of Production Economics, Elsevier, vol. 87(2), pages 141-147, January.
    8. Bo Chen & Xiaotie Deng & Wenan Zang, 2004. "On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 85-95, March.
    9. Ou, Jinwen & Lu, Lingfa & Zhong, Xueling, 2023. "Parallel-batch scheduling with rejection: Structural properties and approximation algorithms," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1017-1032.
    10. Beat Gfeller & Leon Peeters & Birgitta Weber & Peter Widmayer, 2009. "Single machine batch scheduling with release times," Journal of Combinatorial Optimization, Springer, vol. 17(3), pages 323-338, April.
    11. Tang, Lixin & Zhao, Yufang, 2008. "Scheduling a single semi-continuous batching machine," Omega, Elsevier, vol. 36(6), pages 992-1004, December.
    12. Haskilic, Volkan & Ulucan, Aydin & Atici, Kazim Baris & Sarac, Seda Busra, 2023. "A real-world case of autoclave loading and scheduling problems in aerospace composite material production," Omega, Elsevier, vol. 120(C).
    13. Jinjiang Yuan & Shisheng Li & Ji Tian & Ruyan Fu, 2009. "A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times," Journal of Combinatorial Optimization, Springer, vol. 17(2), pages 206-213, February.
    14. Chung Keung Poon & Wenci Yu, 2005. "On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity," Journal of Combinatorial Optimization, Springer, vol. 9(2), pages 167-186, March.
    15. Ridouard, Frédéric & Richard, Pascal & Martineau, Patrick, 2008. "On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1327-1342, September.
    16. Xia Qian & Zhang Xingong, 2023. "Online scheduling of two-machine flowshop with lookahead and incompatible job families," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-11, January.
    17. Damodaran, Purushothaman & Kumar Manjeshwar, Praveen & Srihari, Krishnaswami, 2006. "Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms," International Journal of Production Economics, Elsevier, vol. 103(2), pages 882-891, October.
    18. Li, Shuguang, 2017. "Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities," European Journal of Operational Research, Elsevier, vol. 263(3), pages 815-826.
    19. Wang, Jun-Qiang & Fan, Guo-Qiang & Zhang, Yingqian & Zhang, Cheng-Wu & Leung, Joseph Y.-T., 2017. "Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes," European Journal of Operational Research, Elsevier, vol. 258(2), pages 478-490.
    20. Jianxin Fang & Brenda Cheang & Andrew Lim, 2023. "Problems and Solution Methods of Machine Scheduling in Semiconductor Manufacturing Operations: A Survey," Sustainability, MDPI, vol. 15(17), pages 1-44, August.

    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:116:y:2023:i:c:s0305048322002109. 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.