IDEAS home Printed from https://ideas.repec.org/a/wly/isacfm/v8y1999i2p119-129.html
   My bibliography  Save this article

Algorithms for handling soft constraints and their applications to staff scheduling problems

Author

Listed:
  • Qi Zhao
  • Randy Goebel

Abstract

This paper presents a new model for dynamically deciding when, how, and to what extent soft constraints should be relaxed. The first part of the model is a depth‐first search algorithm and a best‐first repair algorithm which can generate partial schedules quickly. The second part is an iterative relaxation algorithm which can augment the generated partial schedules by slightly relaxing potentially relaxable constraints (i.e. soft constraints). The model guarantees that (1) a soft constraint will be relaxed only when no backtrack (repair) can be made within a time limit, (2) the relaxation of soft constraints can always deepen the search tree, and (3) the relaxation will only be made at dead nodes, and when the search algorithm can be continued the relaxed soft constraints will return to their initial states. The model has been successfully applied to two staff scheduling problems, dispatcher scheduling problem and crew scheduling problem. Copyright © 1999 John Wiley & Sons, Ltd.

Suggested Citation

  • Qi Zhao & Randy Goebel, 1999. "Algorithms for handling soft constraints and their applications to staff scheduling problems," Intelligent Systems in Accounting, Finance and Management, John Wiley & Sons, Ltd., vol. 8(2), pages 119-129, June.
    • Handle: RePEc:wly:isacfm:v:8:y:1999:i:2:p:119-129
    DOI: 10.1002/(SICI)1099-1174(199906)8:23.0.CO;2-N
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1099-1174(199906)8:23.0.CO;2-N
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1099-1174(199906)8:23.0.CO;2-N?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
    ---><---

    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:wly:isacfm:v:8:y:1999:i:2:p:119-129. 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: Wiley Content Delivery (email available below). General contact details of provider: http://www.interscience.wiley.com/jpages/1099-1174/ .

    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.