IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v56y2018i6p2361-2369.html
   My bibliography  Save this article

No-wait two-machine permutation flow shop scheduling problem with learning effect, common due date and controllable job processing times

Author

Listed:
  • Fu Gao
  • Mengqi Liu
  • Jian-Jun Wang
  • Yuan-Yuan Lu

Abstract

We consider a two-machine no-wait permutation flow shop common due date assignment scheduling problem where the processing time of a job is given as a function of its position in the sequence and its amount of resource allocated to this job. The common due date (CON) assignment method means that all the jobs are given a common due date. We need to make a decision on the common due date, resource allocation and the sequence of jobs to minimise total earliness, tardiness, common due date cost and total resource cost. We show that the problem remains polynomially solvable under the proposed model.

Suggested Citation

  • Fu Gao & Mengqi Liu & Jian-Jun Wang & Yuan-Yuan Lu, 2018. "No-wait two-machine permutation flow shop scheduling problem with learning effect, common due date and controllable job processing times," International Journal of Production Research, Taylor & Francis Journals, vol. 56(6), pages 2361-2369, March.
    • Handle: RePEc:taf:tprsxx:v:56:y:2018:i:6:p:2361-2369
    DOI: 10.1080/00207543.2017.1371353
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2017.1371353
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2017.1371353?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, 2022. "Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 79-97, January.
    2. Ali Kordmostafapour & Javad Rezaeian & Iraj Mahdavi & Mahdi Yar Farjad, 2022. "Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1438-1470, December.

    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:tprsxx:v:56:y:2018:i:6:p:2361-2369. 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/TPRS20 .

    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.