IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v70y2019i11p1997-2003.html
   My bibliography  Save this article

Improved algorithms for scheduling on proportionate flowshop with job-rejection

Author

Listed:
  • Baruch Mor
  • Dana Shapira

Abstract

The rejection method is an option commonly used in manufacturing systems as a tool to overcome overloaded assembly lines. The operations manager is given the ability to refuse to produce, or alternately to outsource some of the products. A flowshop environment is a setting of machines in series such that each job should be processed on each of the machines. In a recent paper, Shabtay and Oron (2016), the two disciplines are combined, and the makespan criteria is studied, which is one of the fundamental measures in scheduling theory that reveals the utilization of the system. The problems considered are minimizing the makespan subject to a constraint on the maximal rejection cost, E, and minimizing the rejection cost given that the makespan cannot exceed a given upper bound, K. The computational complexity of the pseudo polynomial dynamic programming (DP) algorithms presented by Shabtay and Oron are O(n2E) and O(n2K), respectively, where n is the number of jobs. In this paper, we consider the same problems, and our contributions are enhanced DP algorithms, which run in O(nE) and O(nK) time, in correspondence, implying an improvement of a factor of n. Furthermore, we supply empirical results based on the experimental simulations. This study, therefore, has both theoretical significance and practical implications, as our numerical study proves that the introduced DP algorithms are capable of solving large-size instances.

Suggested Citation

  • Baruch Mor & Dana Shapira, 2019. "Improved algorithms for scheduling on proportionate flowshop with job-rejection," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(11), pages 1997-2003, November.
    • Handle: RePEc:taf:tjorxx:v:70:y:2019:i:11:p:1997-2003
    DOI: 10.1080/01605682.2018.1506540
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2018.1506540
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2018.1506540?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. Baruch Mor & Gur Mosheiov, 2021. "A note: flowshop scheduling with linear deterioration and job-rejection," 4OR, Springer, vol. 19(1), pages 103-111, March.
    2. Baruch Mor & Dana Shapira, 2022. "Single machine scheduling with non-availability interval and optional job rejection," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 480-497, August.
    3. Baruch Mor & Gur Mosheiov, 2022. "Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection," Operational Research, Springer, vol. 22(3), pages 2707-2719, July.
    4. Mosheiov, Gur & Oron, Daniel & Shabtay, Dvir, 2021. "Minimizing total late work on a single machine with generalized due-dates," European Journal of Operational Research, Elsevier, vol. 293(3), pages 837-846.
    5. Baruch Mor, 2023. "Single machine scheduling problems involving job-dependent step-deterioration dates and job rejection," Operational Research, Springer, vol. 23(1), pages 1-19, March.
    6. Matan Atsmony & Gur Mosheiov, 2023. "Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection," Journal of Scheduling, Springer, vol. 26(2), pages 193-207, April.

    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:taf:tjorxx:v:70:y:2019:i:11:p:1997-2003. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.