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

Fixed interval scheduling: Models, applications, computational complexity and algorithms

Author

Listed:
  • Kovalyov, Mikhail Y.
  • Ng, C.T.
  • Cheng, T.C. Edwin

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:178:y:2007:i:2:p:331-342
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00355-9
    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. Ilya Gertsbakh & Helman I. Stern, 1978. "Minimal Resources for Fixed and Variable Job Schedules," Operations Research, INFORMS, vol. 26(1), pages 68-85, February.
    2. Leo G. Kroon & Marc Salomon & Luk N. Van Wassenhove, 1997. "Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem," Operations Research, INFORMS, vol. 45(4), pages 624-638, August.
    3. Dijkstra, Matthijs C. & Kroon, Leo G. & van Nunen, Jo A. E. E. & Salomon, Marc, 1991. "A DSS for capacity planning of aircraft maintenance personnel," International Journal of Production Economics, Elsevier, vol. 23(1-3), pages 69-78, October.
    4. WATERER, Hamish & JOHNSON, Ellis & NOBILI, Paolo & SAVELSBERGH, Martin, 2002. "The relation of time indexed formulations of single machine scheduling problems to the node packing problem," LIDAM Reprints CORE 1585, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Luana E. Gibbons & Donald W. Hearn & Panos M. Pardalos & Motakuri V. Ramana, 1997. "Continuous Characterizations of the Maximum Clique Problem," Mathematics of Operations Research, INFORMS, vol. 22(3), pages 754-768, August.
    6. WATERER, Hamish & JOHNSON, Ellis & SAVELSBERGH, Martin, 2002. "The relation of time indexed formulations of single machine scheduling problems to the node packing problem," LIDAM Discussion Papers CORE 2002009, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. 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.
    8. Kolen, Antoon W. J. & Kroon, Leo G., 1991. "On the computational complexity of (maximum) class scheduling," European Journal of Operational Research, Elsevier, vol. 54(1), pages 23-38, September.
    9. Michael W. Carter & Craig A. Tovey, 1992. "When Is the Classroom Assignment Problem Hard?," Operations Research, INFORMS, vol. 40(1-supplem), pages 28-39, February.
    10. Martello, Silvano & Toth, Paolo, 1986. "A heuristic approach to the bus driver scheduling problem," European Journal of Operational Research, Elsevier, vol. 24(1), pages 106-117, January.
    11. V. R. Dondeti & Hamilton Emmons, 1992. "Fixed Job Scheduling with Two Types of Processors," Operations Research, INFORMS, vol. 40(1-supplem), pages 76-85, February.
    12. Gabrel, Virginie, 1995. "Scheduling jobs within time windows on identical parallel machines: New model and algorithms," European Journal of Operational Research, Elsevier, vol. 83(2), pages 320-329, June.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    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. Borgonjon, Tessa & Maenhout, Broos, 2022. "An exact approach for the personnel task rescheduling problem with task retiming," European Journal of Operational Research, Elsevier, vol. 296(2), pages 465-484.
    9. Laureano Escudero & Javier Salmeron, 2005. "On a Fix-and-Relax Framework for a Class of Project Scheduling Problems," Annals of Operations Research, Springer, vol. 140(1), pages 163-188, November.
    10. 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.
    11. Nurre, Sarah G. & Cavdaroglu, Burak & Mitchell, John E. & Sharkey, Thomas C. & Wallace, William A., 2012. "Restoring infrastructure systems: An integrated network design and scheduling (INDS) problem," European Journal of Operational Research, Elsevier, vol. 223(3), pages 794-806.
    12. Louis-Philippe Bigras & Michel Gamache & Gilles Savard, 2008. "Time-Indexed Formulations and the Total Weighted Tardiness Problem," INFORMS Journal on Computing, INFORMS, vol. 20(1), pages 133-142, February.
    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. Pasquale Avella & Maurizio Boccia & Carlo Mannino & Igor Vasilyev, 2017. "Time-Indexed Formulations for the Runway Scheduling Problem," Transportation Science, INFORMS, vol. 51(4), pages 1196-1209, November.
    15. Zhang, Xiandong & (Yale) Gong, Yeming & Zhou, Shuyu & de Koster, René & van de Velde, Steef, 2016. "Increasing the revenue of self-storage warehouses by optimizing order scheduling," European Journal of Operational Research, Elsevier, vol. 252(1), pages 69-78.
    16. Siwate Rojanasoonthon & Jonathan Bard, 2005. "A GRASP for Parallel Machine Scheduling with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 32-51, February.
    17. Ciamac C. Moallemi & Utkarsh Patange, 2024. "Hybrid Scheduling with Mixed-Integer Programming at Columbia Business School," Interfaces, INFORMS, vol. 54(3), pages 222-240, May.
    18. Chuangyin Dang & Liying Kang, 2004. "Batch-Processing Scheduling with Setup Times," Journal of Combinatorial Optimization, Springer, vol. 8(2), pages 137-146, June.
    19. Craig A. Tovey, 2002. "Tutorial on Computational Complexity," Interfaces, INFORMS, vol. 32(3), pages 30-61, June.
    20. 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.

    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:178:y:2007:i:2:p:331-342. 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.