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

Kan Fang, Wenchang Luo and Ada Che

Journal of the Operational Research Society, 2021, vol. 72, issue 11, 2429-2441

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.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2020.1796533 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:72:y:2021:i:11:p:2429-2441

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2020.1796533

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().