IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v40y1992i1-supplement-1ps96-s108.html
   My bibliography  Save this article

Approximation Algorithms for Fixed Job Schedule Problems

Author

Listed:
  • Matteo Fischetti

    (University of Bologna, Bologna, Italy)

  • Silvano Martello

    (University of Bologna, Bologna, Italy)

  • Paolo Toth

    (University of Bologna, Bologna, Italy)

Abstract

We consider two generalizations of the fixed job schedule problem, obtained by imposing a bound on the spread-time or on the working time of each processor. These NP-hard problems, studied by the authors in previous works, can arise in bus driver scheduling. We introduce several polynomial-time approximation algorithms, give efficient implementations for them, and analyze their complexity and worst case performance. The average behavior is also investigated through extensive computational experiments.

Suggested Citation

  • Matteo Fischetti & Silvano Martello & Paolo Toth, 1992. "Approximation Algorithms for Fixed Job Schedule Problems," Operations Research, INFORMS, vol. 40(1-supplem), pages 96-108, February.
    • Handle: RePEc:inm:oropre:v:40:y:1992:i:1-supplement-1:p:s96-s108
    DOI: 10.1287/opre.40.1.S96
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.40.1.S96
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.40.1.S96?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bekki, Özgün BarIs & Azizoglu, Meral, 2008. "Operational fixed interval scheduling problem on uniform parallel machines," International Journal of Production Economics, Elsevier, vol. 112(2), pages 756-768, April.
    2. Chuangyin Dang & Liying Kang, 2004. "Batch-Processing Scheduling with Setup Times," Journal of Combinatorial Optimization, Springer, vol. 8(2), pages 137-146, June.
    3. Artiouchine, Konstantin & Baptiste, Philippe & Dürr, Christoph, 2008. "Runway sequencing with holding patterns," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1254-1266, September.
    4. Türsel Eliiyi, Deniz & Azizoglu, Meral, 2011. "Heuristics for operational fixed job scheduling problems with working and spread time constraints," International Journal of Production Economics, Elsevier, vol. 132(1), pages 107-121, July.
    5. Kroon, Leo G. & Salomon, Marc & Van Wassenhove, Luk N., 1995. "Exact and approximation algorithms for the operational fixed interval scheduling problem," European Journal of Operational Research, Elsevier, vol. 82(1), pages 190-205, April.
    6. Antoon W.J. Kolen & Jan Karel Lenstra & Christos H. Papadimitriou & Frits C.R. Spieksma, 2007. "Interval scheduling: A survey," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(5), pages 530-543, August.
    7. Krishnamoorthy, M. & Ernst, A.T. & Baatar, D., 2012. "Algorithms for large scale Shift Minimisation Personnel Task Scheduling Problems," European Journal of Operational Research, Elsevier, vol. 219(1), pages 34-48.
    8. Yim, Seho & Hong, Sung-Pil & Park, Myoung-Ju & Chung, Yerim, 2022. "Inverse interval scheduling via reduction on a single machine," European Journal of Operational Research, Elsevier, vol. 303(2), pages 541-549.
    9. Kovalyov, Mikhail Y. & Ng, C.T. & Cheng, T.C. Edwin, 2007. "Fixed interval scheduling: Models, applications, computational complexity and algorithms," European Journal of Operational Research, Elsevier, vol. 178(2), pages 331-342, April.
    10. Kroon, Leo G. & Edwin Romeijn, H. & Zwaneveld, Peter J., 1997. "Routing trains through railway stations: complexity issues," European Journal of Operational Research, Elsevier, vol. 98(3), pages 485-498, May.

    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:inm:oropre:v:40:y:1992:i:1-supplement-1:p:s96-s108. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.