IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v48y1998i3p359-375.html
   My bibliography  Save this article

Heuristics for short route job shop scheduling problems

Author

Listed:
  • Inna G. Drobouchevitch
  • Vitaly A. Strusevich

Abstract

We consider two “minimum”NP-hard job shop scheduling problems to minimize the makespan. In one of the problems every job has to be processed on at most two out of three available machines. In the other problem there are two machines, and a job may visit one of the machines twice. For each problem, we define a class of heuristic schedules in which certain subsets of operations are kept as blocks on the corresponding machines. We show that for each problem the value of the makespan of the best schedule in that class cannot be less than 3/2 times the optimal value, and present algorithms that guarantee a worst-case ratio of 3/2. Copyright Springer-Verlag Berlin Heidelberg 1998

Suggested Citation

  • Inna G. Drobouchevitch & Vitaly A. Strusevich, 1998. "Heuristics for short route job shop scheduling problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 48(3), pages 359-375, December.
    • Handle: RePEc:spr:mathme:v:48:y:1998:i:3:p:359-375
    DOI: 10.1007/s001860050033
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860050033
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860050033?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. Drobouchevitch, I. G. & Strusevich, V. A., 2000. "Heuristics for the two-stage job shop scheduling problem with a bottleneck machine," European Journal of Operational Research, Elsevier, vol. 123(2), pages 229-240, June.

    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:mathme:v:48:y:1998:i:3:p:359-375. 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.