IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v112y2008i1p138-150.html
   My bibliography  Save this article

Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint

Author

Listed:
  • Kacem, Imed
  • Chu, Chengbin

Abstract

In this article, we consider the single-machine scheduling problem with one availability constraint. We aim to minimize the weighted sum of completion times. We propose a branch-and-bound algorithm based on a set of improved lower bounds and heuristics. The numerical experiments show the effectiveness of the proposed method. The improved algorithm is able to solve instances of 6000 jobs in a reasonable amount of computation time.

Suggested Citation

  • Kacem, Imed & Chu, Chengbin, 2008. "Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint," International Journal of Production Economics, Elsevier, vol. 112(1), pages 138-150, March.
    • Handle: RePEc:eee:proeco:v:112:y:2008:i:1:p:138-150
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(07)00132-6
    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. Guoqing Wang & Hongyi Sun & Chengbin Chu, 2005. "Preemptive Scheduling with Availability Constraints to Minimize Total Weighted Completion Times," Annals of Operations Research, Springer, vol. 133(1), pages 183-192, January.
    2. Schmidt, Gunter, 2000. "Scheduling with limited machine availability," European Journal of Operational Research, Elsevier, vol. 121(1), pages 1-15, February.
    3. Aggoune, Riad, 2004. "Minimizing the makespan for the flow shop scheduling problem with availability constraints," European Journal of Operational Research, Elsevier, vol. 153(3), pages 534-543, March.
    4. W J Chen, 2006. "Minimizing total flow time in the single-machine scheduling problem with periodic maintenance," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(4), pages 410-415, April.
    5. Webster, Scott, 1995. "Weighted flow time bounds for scheduling identical processors," European Journal of Operational Research, Elsevier, vol. 80(1), pages 103-111, January.
    6. X Qi & T Chen & F Tu, 1999. "Scheduling the maintenance on a single machine," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(10), pages 1071-1078, October.
    7. Allaoui, H. & Artiba, A. & Elmaghraby, S.E. & Riane, F., 2006. "Scheduling of a two-machine flowshop with availability constraints on the first machine," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 16-27, February.
    8. Potts, C. N. & Van Wassenhove, L. N., 1983. "An algorithm for single machine sequencing with deadlines to minimize total weighted completion time," European Journal of Operational Research, Elsevier, vol. 12(4), pages 379-387, April.
    9. M. A. Kubzin & V. A. Strusevich, 2006. "Planning Machine Maintenance in Two-Machine Shop Scheduling," Operations Research, INFORMS, vol. 54(4), pages 789-800, August.
    10. Aggoune, Riad & Portmann, Marie-Claude, 2006. "Flow shop scheduling problem with limited machine availability: A heuristic approach," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 4-15, February.
    11. Sadfi, Cherif & Penz, Bernard & Rapine, Christophe & Blazewicz, Jacek & Formanowicz, Piotr, 2005. "An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints," European Journal of Operational Research, Elsevier, vol. 161(1), pages 3-10, February.
    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. Shabtay, Dvir, 2022. "Single-machine scheduling with machine unavailability periods and resource dependent processing times," European Journal of Operational Research, Elsevier, vol. 296(2), pages 423-439.
    2. Kellerer, Hans & Kubzin, Mikhail A. & Strusevich, Vitaly A., 2009. "Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval," European Journal of Operational Research, Elsevier, vol. 199(1), pages 111-116, November.
    3. Chung-Ho Su & Jen-Ya Wang, 2022. "A Branch-and-Bound Algorithm for Minimizing the Total Tardiness of Multiple Developers," Mathematics, MDPI, vol. 10(7), pages 1-24, April.
    4. Shabtay, Dvir & Zofi, Moshe, 2018. "Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 198(C), pages 191-200.
    5. Kerem Bülbül & Safia Kedad-Sidhoum & Halil Şen, 2019. "Single-machine common due date total earliness/tardiness scheduling with machine unavailability," Journal of Scheduling, Springer, vol. 22(5), pages 543-565, October.
    6. N Safaei & R Tavakkoli-Moghaddam & F Sassani, 2009. "A series—parallel redundant reliability system for cellular manufacturing design," Journal of Risk and Reliability, , vol. 223(3), pages 233-250, September.
    7. Asmaa Khoudi & Ali Berrichi, 2020. "Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective branch and bound algorithm," Operational Research, Springer, vol. 20(3), pages 1763-1789, September.

    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. Imed Kacem, 2009. "Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval," Journal of Combinatorial Optimization, Springer, vol. 17(2), pages 117-133, February.
    2. Kacem, Imed & Chu, Chengbin, 2008. "Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1080-1089, June.
    3. Hanane Krim & Rachid Benmansour & David Duvivier & Daoud Aït-Kadi & Said Hanafi, 2020. "Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance," Computational Optimization and Applications, Springer, vol. 75(1), pages 291-320, January.
    4. Seyed Habib A. Rahmati & Abbas Ahmadi & Kannan Govindan, 2018. "A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach," Annals of Operations Research, Springer, vol. 269(1), pages 583-621, October.
    5. 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.
    6. Shabtay, Dvir, 2022. "Single-machine scheduling with machine unavailability periods and resource dependent processing times," European Journal of Operational Research, Elsevier, vol. 296(2), pages 423-439.
    7. Shabtay, Dvir & Zofi, Moshe, 2018. "Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 198(C), pages 191-200.
    8. Chen, Wen-Jinn, 2009. "Minimizing number of tardy jobs on a single machine subject to periodic maintenance," Omega, Elsevier, vol. 37(3), pages 591-599, June.
    9. Shijin Wang & Ming Liu, 2016. "Two-machine flow shop scheduling integrated with preventive maintenance planning," International Journal of Systems Science, Taylor & Francis Journals, vol. 47(3), pages 672-690, February.
    10. Hans Kellerer & Vitaly A. Strusevich, 2016. "Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications," Annals of Operations Research, Springer, vol. 240(1), pages 39-94, May.
    11. Imed Kacem & Hans Kellerer & Maryam Seifaddini, 2016. "Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 970-981, October.
    12. Wenchang Luo & Yao Xu & Weitian Tong & Guohui Lin, 2019. "Single-machine scheduling with job-dependent machine deterioration," Journal of Scheduling, Springer, vol. 22(6), pages 691-707, December.
    13. Sun, Kaibiao & Li, Hongxing, 2010. "Scheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines," International Journal of Production Economics, Elsevier, vol. 124(1), pages 151-158, March.
    14. Shi-Sheng Li & Ren-Xia Chen, 2022. "Minimizing total weighted late work on a single-machine with non-availability intervals," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1330-1355, September.
    15. Jing Fan & Xiwen Lu, 2015. "Supply chain scheduling problem in the hospital with periodic working time on a single machine," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 892-905, November.
    16. Mellouli, Racem & Sadfi, Chrif & Chu, Chengbin & Kacem, Imed, 2009. "Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times," European Journal of Operational Research, Elsevier, vol. 197(3), pages 1150-1165, September.
    17. Olivier Guyon & Pierre Lemaire & Éric Pinson & David Rivreau, 2014. "Solving an integrated job-shop problem with human resource constraints," Annals of Operations Research, Springer, vol. 213(1), pages 147-171, February.
    18. Allaoui, H. & Lamouri, S. & Artiba, A. & Aghezzaf, E., 2008. "Simultaneously scheduling n jobs and the preventive maintenance on the two-machine flow shop to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 112(1), pages 161-167, March.
    19. Yunqiang Yin & Jianyou Xu & T. C. E. Cheng & Chin‐Chia Wu & Du‐Juan Wang, 2016. "Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(2), pages 172-183, March.
    20. Weiwei Cui & Biao Lu, 2020. "A Bi-Objective Approach to Minimize Makespan and Energy Consumption in Flow Shops with Peak Demand Constraint," Sustainability, MDPI, vol. 12(10), pages 1-22, May.

    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:proeco:v:112:y:2008:i:1:p:138-150. 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/ijpe .

    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.