IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v60y2013i6p449-453.html
   My bibliography  Save this article

A note on combined job selection and sequencing problems

Author

Listed:
  • Christos Koulamas
  • Shrikant. S. Panwalkar

Abstract

We investigate the solvability of two single‐machine scheduling problems when the objective is to identify among all job subsets with cardinality k,1≤k≤n, the one that has the minimum objective function value. For the single‐machine minimum maximum lateness problem, we conclude that the problem is solvable in O(n2) time using the proposed REMOVE algorithm. This algorithm can also be used as an alternative to Moore's algorithm to solve the minimum number of tardy jobs problem by actually solving the hierarchical problem in which the objective is to minimize the maximum lateness subject to the minimum number of tardy jobs. We then show that the REMOVE algorithm cannot be used to solve the general case of the single‐machine total‐weighted completion time problem; we derive sufficient conditions among the job parameters so that the total weighted completion time problem becomes solvable in O(n2) time. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 449–453, 2013

Suggested Citation

  • Christos Koulamas & Shrikant. S. Panwalkar, 2013. "A note on combined job selection and sequencing problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(6), pages 449-453, September.
    • Handle: RePEc:wly:navres:v:60:y:2013:i:6:p:449-453
    DOI: 10.1002/nav.21543
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21543
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21543?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
    ---><---

    References listed on IDEAS

    as
    1. Panwalkar, S.S. & Koulamas, Christos, 2012. "An O(n2) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines," European Journal of Operational Research, Elsevier, vol. 221(1), pages 7-13.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Davood Golmohammadi & S. Afshin Mansouri, 2015. "Complexity and workload considerations in product mix decisions under the theory of constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(5), pages 357-369, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. S.S. Panwalkar & Milton L. Smith & Christos Koulamas, 2013. "Review of the ordered and proportionate flow shop scheduling research," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(1), pages 46-55, February.
    2. Della Croce, Federico & Koulamas, Christos & T'kindt, Vincent, 2017. "A constraint generation approach for two-machine shop problems with jobs selection," European Journal of Operational Research, Elsevier, vol. 259(3), pages 898-905.

    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:wly:navres:v:60:y:2013:i:6:p:449-453. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.