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

A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates

Author

Listed:
  • Sadykov, Ruslan

Abstract

In this paper we consider the scheduling problem of minimizing the weighted number of late jobs on a single machine (1rj[summation operator]wjUj). A branch-and-check algorithm is proposed, where a relaxed integer programming formulation is solved by branch-and-bound and infeasible solutions are cut off using infeasibility cuts. We suggest two ways to generate cuts. First, tightened "no-good" cuts are derived using a modification of the algorithm by Carlier (1982, EJOR, v.11, 42-47) which was developed for the problem of minimizing maximum lateness on a single machine. Secondly we show how to create cuts by using constraint propagation. The proposed algorithm is implemented in the Mosel modelling and optimization language. Computational experiments on instances with up to 140 jobs are reported. A comparison is presented with the exact approach of Péridy at al. (2003, EJOR, v.148, 591-603).

Suggested Citation

  • Sadykov, Ruslan, 2008. "A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1284-1304, September.
    • Handle: RePEc:eee:ejores:v:189:y:2008:i:3:p:1284-1304
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00599-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. Baptiste, Philippe & Peridy, Laurent & Pinson, Eric, 2003. "A branch and bound to minimize the number of late jobs on a single machine with release time constraints," European Journal of Operational Research, Elsevier, vol. 144(1), pages 1-11, January.
    3. Ruslan Sadykov & Laurence A. Wolsey, 2006. "Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates," INFORMS Journal on Computing, INFORMS, vol. 18(2), pages 209-217, May.
    4. Linus Schrage, 1970. "Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case," Operations Research, INFORMS, vol. 18(2), pages 263-278, April.
    5. Carlier, Jacques, 1982. "The one-machine sequencing problem," European Journal of Operational Research, Elsevier, vol. 11(1), pages 42-47, September.
    6. Peridy, Laurent & Pinson, Eric & Rivreau, David, 2003. "Using short-term memory to minimize the weighted number of late jobs on a single machine," European Journal of Operational Research, Elsevier, vol. 148(3), pages 591-603, August.
    7. Sevaux, Marc & Dauzere-Peres, Stephane, 2003. "Genetic algorithms to minimize the weighted number of late jobs on a single machine," European Journal of Operational Research, Elsevier, vol. 151(2), pages 296-306, December.
    8. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(1), pages 193-194, February.
    9. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(2), pages 541-545, April.
    10. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(4), pages 1007-1017, August.
    11. John N. Hooker, 2002. "Logic, Optimization, and Constraint Programming," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 295-321, November.
    12. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(6), pages 1461-1465, December.
    13. Hiroshi Kise & Toshihide Ibaraki & Hisashi Mine, 1978. "A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times," Operations Research, INFORMS, vol. 26(1), pages 121-126, February.
    14. J. Michael Moore, 1968. "An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs," Management Science, INFORMS, vol. 15(1), pages 102-109, September.
    15. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(5), pages 1273-1289, October.
    16. SADYKOV, Ruslan & WOLSEY, Laurence A., 2006. "Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates," LIDAM Reprints CORE 1854, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    17. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(3), pages 819-821, 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. Aigerim Saken & Emil Karlsson & Stephen J. Maher & Elina Rönnberg, 2023. "Computational Evaluation of Cut-Strengthening Techniques in Logic-Based Benders’ Decomposition," SN Operations Research Forum, Springer, vol. 4(3), pages 1-53, September.
    2. François Clautiaux & Boris Detienne & Henri Lefebvre, 2023. "A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty," Journal of Scheduling, Springer, vol. 26(2), pages 169-191, April.
    3. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    4. Detienne, Boris, 2014. "A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints," European Journal of Operational Research, Elsevier, vol. 235(3), pages 540-552.
    5. Aliza Heching & J. N. Hooker & Ryo Kimura, 2019. "A Logic-Based Benders Approach to Home Healthcare Delivery," Transportation Science, INFORMS, vol. 53(2), pages 510-522, March.
    6. Roshanaei, Vahid & Luong, Curtiss & Aleman, Dionne M. & Urbach, David, 2017. "Propagating logic-based Benders’ decomposition approaches for distributed operating room scheduling," European Journal of Operational Research, Elsevier, vol. 257(2), pages 439-455.
    7. Naderi, Bahman & Roshanaei, Vahid, 2020. "Branch-Relax-and-Check: A tractable decomposition method for order acceptance and identical parallel machine scheduling," European Journal of Operational Research, Elsevier, vol. 286(3), pages 811-827.

    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. Ruslan Sadykov & Laurence A. Wolsey, 2006. "Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates," INFORMS Journal on Computing, INFORMS, vol. 18(2), pages 209-217, May.
    2. SADYKOV, Rusland & WOLSEY, Laurence, 2003. "Integer programming and constraint programming in solving a multi-machine assignment scheduling problem with deadlines and release dates," LIDAM Discussion Papers CORE 2003081, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Tallys Yunes & Ionuţ D. Aron & J. N. Hooker, 2010. "An Integrated Solver for Optimization Problems," Operations Research, INFORMS, vol. 58(2), pages 342-356, April.
    4. Detienne, Boris, 2014. "A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints," European Journal of Operational Research, Elsevier, vol. 235(3), pages 540-552.
    5. Cambier, Adrien & Chardy, Matthieu & Figueiredo, Rosa & Ouorou, Adam & Poss, Michael, 2022. "Optimizing subscriber migrations for a telecommunication operator in uncertain context," European Journal of Operational Research, Elsevier, vol. 298(1), pages 308-321.
    6. Libura, Marek, 2007. "On the adjustment problem for linear programs," European Journal of Operational Research, Elsevier, vol. 183(1), pages 125-134, November.
    7. Christophe Loussouarn & Carine Franc & Yann Videau & Julien Mousquès, 2021. "Can General Practitioners Be More Productive? The Impact of Teamwork and Cooperation with Nurses on GP Activities," Health Economics, John Wiley & Sons, Ltd., vol. 30(3), pages 680-698, March.
    8. Tschakert, Petra, 2016. "Shifting Discourses of Vilification and the Taming of Unruly Mining Landscapes in Ghana," World Development, Elsevier, vol. 86(C), pages 123-132.
    9. Isabelle Boutron & Peter John & David J. Torgerson, 2010. "Reporting Methodological Items in Randomized Experiments in Political Science," The ANNALS of the American Academy of Political and Social Science, , vol. 628(1), pages 112-131, March.
    10. Ben Slimane, Faten & Padilla Angulo, Laura, 2019. "Strategic change and corporate governance: Evidence from the stock exchange industry," Journal of Business Research, Elsevier, vol. 103(C), pages 206-218.
    11. Weijun Xie & Yanfeng Ouyang & Sze Chun Wong, 2016. "Reliable Location-Routing Design Under Probabilistic Facility Disruptions," Transportation Science, INFORMS, vol. 50(3), pages 1128-1138, August.
    12. Natalia Nikolaevna Natocheeva* & Yuri Alexandrovich Rovensky & Yuri Yuryevich Rusanov & Tatiana Viktorovna Belyanchikova & Anna Anatolevna Staurskaya, 2018. "Optimizing Variability of Approaches to Regulatory Financing of Higher Education Services," The Journal of Social Sciences Research, Academic Research Publishing Group, pages 221-227:3.
    13. Sahar Validi & Arijit Bhattacharya & P. J. Byrne, 2020. "Sustainable distribution system design: a two-phase DoE-guided meta-heuristic solution approach for a three-echelon bi-objective AHP-integrated location-routing model," Annals of Operations Research, Springer, vol. 290(1), pages 191-222, July.
    14. Andy Hall, 2005. "Capacity development for agricultural biotechnology in developing countries: an innovation systems view of what it is and how to develop it," Journal of International Development, John Wiley & Sons, Ltd., vol. 17(5), pages 611-630.
    15. Athinoula A. Kosti & Simon Colreavy-Donnelly & Fabio Caraffini & Zacharias A. Anastassi, 2020. "Efficient Computation of the Nonlinear Schrödinger Equation with Time-Dependent Coefficients," Mathematics, MDPI, vol. 8(3), pages 1-12, March.
    16. Bruno Frey, 2005. "Problems with Publishing: Existing State and Solutions," European Journal of Law and Economics, Springer, vol. 19(2), pages 173-190, April.
    17. Lan, Heng-you, 2021. "Approximation-solvability of population biology systems based on p-Laplacian elliptic inequalities with demicontinuous strongly pseudo-contractive operators," Chaos, Solitons & Fractals, Elsevier, vol. 150(C).
    18. Shelly Jeffcott & Nick Pidgeon & Andrew Weyman & John Walls, 2006. "Risk, Trust, and Safety Culture in U.K. Train Operating Companies," Risk Analysis, John Wiley & Sons, vol. 26(5), pages 1105-1121, October.
    19. Rainer Niemann, 2004. "Asymmetric Taxation and Cross-Border Investment Decisions," CESifo Working Paper Series 1219, CESifo.
    20. Zhenghua Gu & Xiaomeng Cao & Guoliang Liu & Weizhen Lu, 2014. "Optimizing Operation Rules of Sluices in River Networks Based on Knowledge-driven and Data-driven Mechanism," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 28(11), pages 3455-3469, September.

    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:189:y:2008:i:3:p:1284-1304. 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.