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

Extensions of coloring models for scheduling purposes

Author

Listed:
  • de Werra, D.

Abstract

No abstract is available for this item.

Suggested Citation

  • de Werra, D., 1996. "Extensions of coloring models for scheduling purposes," European Journal of Operational Research, Elsevier, vol. 92(3), pages 474-492, August.
    • Handle: RePEc:eee:ejores:v:92:y:1996:i:3:p:474-492
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(96)00013-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. John J. Bartholdi & James B. Orlin & H. Donald Ratliff, 1980. "Cyclic Scheduling via Integer Programs with Circular Ones," Operations Research, INFORMS, vol. 28(5), pages 1074-1085, October.
    2. Brasel, H. & Kluge, D. & Werner, F., 1994. "A polynomial algorithm for the [n/m/0, tij = 1, tree/Cmax] open shop problem," European Journal of Operational Research, Elsevier, vol. 72(1), pages 125-134, January.
    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. Casado, Silvia & Laguna, Manuel & Pacheco, Joaquín & Puche, Julio C., 2020. "Grouping products for the optimization of production processes: A case in the steel manufacturing industry," European Journal of Operational Research, Elsevier, vol. 286(1), pages 190-202.
    2. Yanez, Javier & Ramirez, Javier, 2003. "The robust coloring problem," European Journal of Operational Research, Elsevier, vol. 148(3), pages 546-558, August.
    3. Al-Yakoob, Salem M. & Sherali, Hanif D., 2006. "Mathematical programming models and algorithms for a class-faculty assignment problem," European Journal of Operational Research, Elsevier, vol. 173(2), pages 488-507, September.
    4. Chung, Yerim & Culus, Jean-François & Demange, Marc, 2015. "Inverse chromatic number problems in interval and permutation graphs," European Journal of Operational Research, Elsevier, vol. 243(3), pages 763-773.
    5. Asratian, A. S. & de Werra, D., 2002. "A generalized class-teacher model for some timetabling problems," European Journal of Operational Research, Elsevier, vol. 143(3), pages 531-542, December.

    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. Aykin, Turgut, 2000. "A comparative evaluation of modeling approaches to the labor shift scheduling problem," European Journal of Operational Research, Elsevier, vol. 125(2), pages 381-397, September.
    2. Michael J. Brusco & Larry W. Jacobs, 2000. "Optimal Models for Meal-Break and Start-Time Flexibility in Continuous Tour Scheduling," Management Science, INFORMS, vol. 46(12), pages 1630-1641, December.
    3. Elizabeth Baldwin & Paul Klemperer, 2019. "Understanding Preferences: “Demand Types”, and the Existence of Equilibrium With Indivisibilities," Econometrica, Econometric Society, vol. 87(3), pages 867-932, May.
    4. Delorme, Xavier & Dolgui, Alexandre & Kovalev, Sergey & Kovalyov, Mikhail Y., 2019. "Minimizing the number of workers in a paced mixed-model assembly line," European Journal of Operational Research, Elsevier, vol. 272(1), pages 188-194.
    5. Yann Ferrand & Michael Magazine & Uday S. Rao & Todd F. Glass, 2011. "Building Cyclic Schedules for Emergency Department Physicians," Interfaces, INFORMS, vol. 41(6), pages 521-533, December.
    6. Tristan Becker & Maximilian Schiffer & Grit Walther, 2022. "A General Branch-and-Cut Framework for Rotating Workforce Scheduling," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1548-1564, May.
    7. Michael J. Brusco & Larry W. Jacobs, 1998. "Personnel Tour Scheduling When Starting-Time Restrictions Are Present," Management Science, INFORMS, vol. 44(4), pages 534-547, April.
    8. Tristan Becker, 2020. "A decomposition heuristic for rotational workforce scheduling," Journal of Scheduling, Springer, vol. 23(5), pages 539-554, October.
    9. Bentz, Cédric & Costa, Marie-Christine & Létocart, Lucas & Roupin, Frédéric, 2009. "Multicuts and integral multiflows in rings," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1251-1254, August.
    10. Arjan Akkermans & Gerhard Post & Marc Uetz, 2021. "Solving the shift and break design problem using integer linear programming," Annals of Operations Research, Springer, vol. 302(2), pages 341-362, July.
    11. Legato, Pasquale & Monaco, M. Flavia, 2004. "Human resources management at a marine container terminal," European Journal of Operational Research, Elsevier, vol. 156(3), pages 769-781, August.
    12. Michael J. Brusco & Larry W. Jacobs, 1993. "A simulated annealing approach to the cyclic staff‐scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(1), pages 69-84, February.
    13. Broos Maenhout & Mario Vanhoucke, 2017. "A resource type analysis of the integrated project scheduling and personnel staffing problem," Annals of Operations Research, Springer, vol. 252(2), pages 407-433, May.
    14. Lara Turner & Dwi Groß & Horst Hamacher & Sven Krumke, 2015. "Static and dynamic source locations in undirected networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(3), pages 619-646, October.
    15. Yang, Yongjie & Dimitrov, Dinko, 2023. "Group control for consent rules with consecutive qualifications," Mathematical Social Sciences, Elsevier, vol. 121(C), pages 1-7.
    16. Giovanni Felici & Claudio Gentile, 2004. "A Polyhedral Approach for the Staff Rostering Problem," Management Science, INFORMS, vol. 50(3), pages 381-393, March.
    17. Bentz, Cédric & Cornaz, Denis & Ries, Bernard, 2013. "Packing and covering with linear programming: A survey," European Journal of Operational Research, Elsevier, vol. 227(3), pages 409-422.
    18. O’Sullivan, Dónal & Newman, Alexandra, 2015. "Optimization-based heuristics for underground mine scheduling," European Journal of Operational Research, Elsevier, vol. 241(1), pages 248-259.
    19. Ingolfsson, Armann & Campello, Fernanda & Wu, Xudong & Cabral, Edgar, 2010. "Combining integer programming and the randomization method to schedule employees," European Journal of Operational Research, Elsevier, vol. 202(1), pages 153-163, April.
    20. Timkovsky, Vadim G., 2003. "Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity," European Journal of Operational Research, Elsevier, vol. 149(2), pages 355-376, 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:92:y:1996:i:3:p:474-492. 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.