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

Simultaneous minimisation of mean and variation of waiting times in a two-stage proportionate blocking flow shop

Author

Listed:
  • Christos Koulamas
  • George J. Kyparisis

Abstract

We consider the two-stage proportionate blocking flow shop scheduling problem with the objective of simultaneously minimising the mean and the variation of job waiting times. We show that the problem can be solved in O(nlogn) time by evaluating at most two candidate optimal sequences. In some cases, the shortest processing time (SPT) sequence is optimal for any set of processing times. In all other cases, the optimal sequence is either the SPT sequence or a V-shaped sequence. We show that the optimal solution value for the corresponding no-wait flow shop scheduling problem is no worse than the optimal solution value for the blocking flow shop problem. We then analyse the blocking flow shop problem with the option of rejecting jobs from the sequence by paying their job-specific rejection penalties. We show that the problem with the job rejection option can be solved in O(n3) time by dynamic programming (DP). Finally, we show that our results also apply to the corresponding flow shop scheduling problem with synchronous job transfers.

Suggested Citation

  • Christos Koulamas & George J. Kyparisis, 2023. "Simultaneous minimisation of mean and variation of waiting times in a two-stage proportionate blocking flow shop," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 74(11), pages 2289-2299, November.
    • Handle: RePEc:taf:tjorxx:v:74:y:2023:i:11:p:2289-2299
    DOI: 10.1080/01605682.2022.2139645
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2022.2139645
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2022.2139645?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.

    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:74:y:2023:i:11:p:2289-2299. 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.