IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v83y1998i0p179-21210.1023-a1018908013582.html
   My bibliography  Save this article

Nonstrict vector summationin multi-operation scheduling

Author

Listed:
  • Sergey Sevastianov

Abstract

We consider several multi-operation scheduling problems with m machines and n jobs, including flow shop, open shop, assembly line, and a few special cases of job shop with the minimum makespan criterion. It is demonstrated that the problems in question can be efficiently solved by approximation algorithms with fairly good performance guarantee in the worst case. The algorithms constructed are based on a geometric technique called “nonstrict vector summation“. It consists of assigning an (m−1)-dimensional vector to each job and then finding an order in which these vectors should be summed so that all partial sums would lie within a given family of half-spaces (specified for a given scheduling problem).The partial sums are allowed sometimes to go out of this or that half-space of the family, which explains the term “nonstrict” in the title of the paper. For the open shop problem, this technique guarantees its polynomial-time solution, provided that the maximum machine load l max (i.e., the maximum over all machines of the total processing time of operations of a machine) is large enough. In the case of three machines and l max as large as at least 7 times the maximum processing time of an operation, we can find the optimal schedule in O(nlog n) time. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Sergey Sevastianov, 1998. "Nonstrict vector summationin multi-operation scheduling," Annals of Operations Research, Springer, vol. 83(0), pages 179-212, October.
  • Handle: RePEc:spr:annopr:v:83:y:1998:i:0:p:179-212:10.1023/a:1018908013582
    DOI: 10.1023/A:1018908013582
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018908013582
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1023/A:1018908013582?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. Goncharov, Yaroslav & Sevastyanov, Sergey, 2009. "The flow shop problem with no-idle constraints: A review and approximation," European Journal of Operational Research, Elsevier, vol. 196(2), pages 450-456, July.
    2. Agnihothri, Saligrama & Cappanera, Paola & Nonato, Maddalena & Visintin, Filippo, 2024. "Appointment scheduling in surgery pre-admission testing clinics," Omega, Elsevier, vol. 123(C).
    3. S. Sevastyanov & D. Chemisova & I. Chernykh, 2014. "On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion," Annals of Operations Research, Springer, vol. 213(1), pages 253-270, February.

    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:spr:annopr:v:83:y:1998:i:0:p:179-212:10.1023/a:1018908013582. 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.