IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v69y1997i0p1-3110.1023-a1018916608787.html
   My bibliography  Save this article

Concurrent operations assignment and sequencing for particular assembly problems in flow lines

Author

Listed:
  • Alessandro Agnetis
  • Claudio Arbib

Abstract

In this paper, we deal with the problem of optimally assigning and sequencing the operations of a set of jobs to the machines of a flow line. The operations of each job are to be executed according to the precedence constraints specified by the operation graph. Here, we analyze the special case in which the assembly operations are strictly ordered. The problem consists in assigning the operations to the machines and sequencing them so that some productivity index is maximized. The model proposed fits in particular situations where few identical product items requiring a large amount of operations are to be produced, and accounts for such issues as: limited buffer capacity, FCFS versus LCFS buffer operation, set-up and transportation times, machines with different speeds, tools and tool magazine restrictions. In this scenario, polynomial-time dynamic programming algorithms for makespan or inventory costs minimization are proposed. Copyright Kluwer Academic Publishers 1997

Suggested Citation

  • Alessandro Agnetis & Claudio Arbib, 1997. "Concurrent operations assignment and sequencing for particular assembly problems in flow lines," Annals of Operations Research, Springer, vol. 69(0), pages 1-31, January.
    • Handle: RePEc:spr:annopr:v:69:y:1997:i:0:p:1-31:10.1023/a:1018916608787
    DOI: 10.1023/A:1018916608787
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018916608787
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018916608787?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. Andres, Carlos & Miralles, Cristobal & Pastor, Rafael, 2008. "Balancing and scheduling tasks in assembly lines with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1212-1223, June.

    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:69:y:1997:i:0:p:1-31:10.1023/a:1018916608787. 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.