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

Speed scaling in two-machine lot-streaming flow shops with consistent sublots

Author

Listed:
  • Kan Fang
  • Wenchang Luo
  • Ada Che

Abstract

We consider a single-job model lot streaming problem in two-machine flow shops with speed scaling, in which the job can be splitted into n consistent sublots, and each sublot can be processed at varying continuous speeds on each machine. The aim is to find an optimal schedule that determines both the sizes and the processing speeds of sublots so that the job can be finished before a given deadline and the total energy consumption is minimized. To solve this problem, we investigate the structural properties of the optimal schedules and show that it can be obtained within a no-wait environment. Then, we show that the problem is in fact a convex optimization problem, and can be solved by existing convex programming techniques.

Suggested Citation

  • Kan Fang & Wenchang Luo & Ada Che, 2021. "Speed scaling in two-machine lot-streaming flow shops with consistent sublots," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(11), pages 2429-2441, November.
    • Handle: RePEc:taf:tjorxx:v:72:y:2021:i:11:p:2429-2441
    DOI: 10.1080/01605682.2020.1796533
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2020.1796533
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2020.1796533?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:72:y:2021:i:11:p:2429-2441. 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.