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

Minimizing late jobs in the general one machine scheduling problem

Author

Listed:
  • Dauzere-Peres, Stephane

Abstract

No abstract is available for this item.

Suggested Citation

  • Dauzere-Peres, Stephane, 1995. "Minimizing late jobs in the general one machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 81(1), pages 134-142, February.
    • Handle: RePEc:eee:ejores:v:81:y:1995:i:1:p:134-142
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00116-T
    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. DYER, Martin E. & WOLSEY, Laurence A., 1990. "Formulating the single machine sequencing problem with release dates as a mixed integer program," LIDAM Reprints CORE 878, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. E. DYER, Martin & WOLSEY, Laurence A., 1990. "Formulating the single machine sequencing problem with release dates as a mixed integer program," LIDAM Reprints CORE 917, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. C. N. Potts & L. N. Van Wassenhove, 1988. "Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs," Management Science, INFORMS, vol. 34(7), pages 843-858, July.
    4. 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.
    5. 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.
    6. Hall, Nicholas G. & Sethi, Suresh P. & Sriskandarajah, Chelliah, 1991. "On the complexity of generalized due date scheduling problems," European Journal of Operational Research, Elsevier, vol. 51(1), pages 100-109, March.
    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. Gowrishankar, K. & Rajendran, Chandrasekharan & Srinivasan, G., 2001. "Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date," European Journal of Operational Research, Elsevier, vol. 132(3), pages 643-665, August.
    2. M'Hallah, Rym & Bulfin, R. L., 2003. "Minimizing the weighted number of tardy jobs on a single machine," European Journal of Operational Research, Elsevier, vol. 145(1), pages 45-56, February.
    3. Bertel, S. & Billaut, J. -C., 2004. "A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation," European Journal of Operational Research, Elsevier, vol. 159(3), pages 651-662, December.
    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. Bornstein, Claudio Thomas & Alcoforado, Luciane Ferreira & Maculan, Nelson, 2005. "A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem," European Journal of Operational Research, Elsevier, vol. 165(3), pages 649-656, 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. M'Hallah, Rym & Bulfin, R.L., 2007. "Minimizing the weighted number of tardy jobs on a single machine with release dates," European Journal of Operational Research, Elsevier, vol. 176(2), pages 727-744, January.
    2. 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.
    3. 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.
    4. Artur Alves Pessoa & Teobaldo Bulhões & Vitor Nesello & Anand Subramanian, 2022. "Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1512-1530, May.
    5. Maria Fleischer Fauske & Carlo Mannino & Paolo Ventura, 2020. "Generalized Periodic Vehicle Routing and Maritime Surveillance," Transportation Science, INFORMS, vol. 54(1), pages 164-183, January.
    6. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    7. Francis Sourd, 2009. "New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 167-175, February.
    8. Pasquale Avella & Maurizio Boccia & Bernardo D’Auria, 2005. "Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 17(2), pages 183-191, May.
    9. 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.
    10. Fabio D'Andreagiovanni & Carlo Mannino & Antonio Sassano, 2009. "A Power-Indexed Formulation for Wireless Network Design," DIS Technical Reports 2009-14, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    11. Philippe Baptiste & Ruslan Sadykov, 2009. "On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(6), pages 487-502, September.
    12. Hejl, Lukáš & Šůcha, Přemysl & Novák, Antonín & Hanzálek, Zdeněk, 2022. "Minimizing the weighted number of tardy jobs on a single machine: Strongly correlated instances," European Journal of Operational Research, Elsevier, vol. 298(2), pages 413-424.
    13. Natashia Boland & Riley Clement & Hamish Waterer, 2016. "A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 14-30, February.
    14. Rachid Benmansour & Oliver Braun & Saïd Hanafi, 2019. "The single-processor scheduling problem with time restrictions: complexity and related problems," Journal of Scheduling, Springer, vol. 22(4), pages 465-471, August.
    15. Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.
    16. Hui Liu & Maurice Queyranne & David Simchi‐Levi, 2005. "On the asymptotic optimality of algorithms for the flow shop problem with release dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(3), pages 232-242, April.
    17. Leonardo Lamorgese & Carlo Mannino, 2019. "A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management," Operations Research, INFORMS, vol. 67(6), pages 1586-1609, November.
    18. Arthur Kramer & Anand Subramanian, 2019. "A unified heuristic and an annotated bibliography for a large class of earliness–tardiness scheduling problems," Journal of Scheduling, Springer, vol. 22(1), pages 21-57, February.
    19. Koulamas, Christos & Kyparisis, George J., 2001. "Single machine scheduling with release times, deadlines and tardiness objectives," European Journal of Operational Research, Elsevier, vol. 133(2), pages 447-453, January.
    20. Stéphane Dauzère-Pérès & Sigrid Lise Nonås, 2023. "An improved decision support model for scheduling production in an engineer-to-order manufacturer," 4OR, Springer, vol. 21(2), pages 247-300, June.

    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:81:y:1995:i:1:p:134-142. 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.