IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v115y2002i1p147-17210.1023-a1021149204501.html
   My bibliography  Save this article

Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment

Author

Listed:
  • Peter Brucker
  • Sigrid Knust

Abstract

We consider a single-machine scheduling problem which arises as a subproblem in a job-shop environment where the jobs have to be transported between the machines by a single transport robot. The robot scheduling problem may be regarded as a generalization of the traveling salesman problem with time windows, where additionally generalized precedence constraints (minimal time-lags) have to be respected. The objective is to determine a sequence of all nodes and corresponding starting times in the given time windows in such a way that all generalized precedence relations are respected and the sum of all traveling and waiting times is minimized. We calculate lower bounds for this problem using constraint propagation techniques and a linear programming formulation which is solved by a column generation procedure. Computational results are presented for test data arising from job-shop instances with a single transport robot and some modified traveling salesman instances. Copyright Kluwer Academic Publishers 2002

Suggested Citation

  • Peter Brucker & Sigrid Knust, 2002. "Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment," Annals of Operations Research, Springer, vol. 115(1), pages 147-172, September.
    • Handle: RePEc:spr:annopr:v:115:y:2002:i:1:p:147-172:10.1023/a:1021149204501
    DOI: 10.1023/A:1021149204501
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1021149204501
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1021149204501?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Yulia Sullivan & Marc Bourmont & Mary Dunaway, 2022. "Appraisals of harms and injustice trigger an eerie feeling that decreases trust in artificial intelligence systems," Annals of Operations Research, Springer, vol. 308(1), pages 525-548, January.

    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:spr:annopr:v:115:y:2002:i:1:p:147-172:10.1023/a:1021149204501. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.