IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v66y2015i5p709-719.html
   My bibliography  Save this article

Two-machine flow shop scheduling with deteriorating jobs: minimizing the weighted sum of makespan and total completion time

Author

Listed:
  • Mingbao Cheng

    (Guangdong University of Technology, Guangzhou, P.R, China)

  • Pandu R Tadikamalla

    (University of Pittsburgh, Pittsburgh, PA, USA)

  • Jennifer Shang

    (University of Pittsburgh, Pittsburgh, PA, USA)

  • Bixi Zhang

    (Guangdong University of Technology, Guangzhou, P.R, China)

Abstract

This paper considers a two-machine flow shop scheduling problem with deteriorating jobs in which the processing times of jobs are dependent on their starting times in the sequence. The objective is to minimize the weighted sum of makespan and total completion time. To analyse the problem, we propose a mixed integer programming model, and discuss several polynomially solvable special cases. We also present a branch-and-bound algorithm with several dominance rules, an upper bound and a lower bound. Finally, we present results of computational experiments conducted to evaluate the performance of the proposed model and the exact algorithm.

Suggested Citation

  • Mingbao Cheng & Pandu R Tadikamalla & Jennifer Shang & Bixi Zhang, 2015. "Two-machine flow shop scheduling with deteriorating jobs: minimizing the weighted sum of makespan and total completion time," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(5), pages 709-719, May.
    • Handle: RePEc:pal:jorsoc:v:66:y:2015:i:5:p:709-719
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v66/n5/pdf/jors201458a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v66/n5/full/jors201458a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.

    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:pal:jorsoc:v:66:y:2015:i:5:p:709-719. 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.palgrave-journals.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.