IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v32y1986i6p731-738.html
   My bibliography  Save this article

A Sequencing Problem with Release Dates and Clustered Jobs

Author

Listed:
  • Marc E. Posner

    (Graduate School of Business Administration, New York University, New York, New York 10006)

Abstract

This paper considers a one-machine scheduling problem where the objective is to minimize the sum of weighted completion times subject to release dates. A polynomial time algorithm is developed for the case when the jobs are clustered. The jobs in each cluster must be processed sequentially and the clusters are ordered. The insights developed are used in an efficient heuristic for the weighted completion time problem without clusters. Also, a class of release date problems is described for which the heuristic finds an optimal solution.

Suggested Citation

  • Marc E. Posner, 1986. "A Sequencing Problem with Release Dates and Clustered Jobs," Management Science, INFORMS, vol. 32(6), pages 731-738, June.
    • Handle: RePEc:inm:ormnsc:v:32:y:1986:i:6:p:731-738
    DOI: 10.1287/mnsc.32.6.731
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.32.6.731
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.32.6.731?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
    ---><---

    Citations

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


    Cited by:

    1. Nicholas G. Hall & Marc E. Posner, 2001. "Generating Experimental Data for Computational Testing with Machine Scheduling Applications," Operations Research, INFORMS, vol. 49(6), pages 854-865, December.

    More about this item

    Keywords

    production scheduling; heuristics;

    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:inm:ormnsc:v:32:y:1986:i:6:p:731-738. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.