Scholarlink

<p>Flow shops are well-studied machine environments in which all jobs must visit all machines in the same order. While conventional flow shops assume that each job traverses the shop only once, many industrial environments require jobs to loop through the shop multiple times before completion. This means that after traversing the shop and completing its processing on the last machine, a job must return to the first machine and traverse the shop again until it has completed all its required loops. Such a setting, referred to as a flow shop with reentry, has numerous applications in industry, e.g., semiconductor manufacturing. The planning problem is to schedule all loops of all jobs while minimizing the total weighted completion time. In this paper, we consider reentrant flow shops with unit processing times. We show that this problem is strongly NP-hard if the number of machines is part of the input. We propose the Least Remaining Loops First (LRL) priority rule and show that it minimizes the total unweighted completion time. Then, we analyze the Weighted Least Remaining Loops First (WLRL) priority rule and show that it has a worst-case performance ratio of <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10951_2025_847_Article_IEq1.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="140" /> </InlineMediaObject> <EquationSource Format="TEX">\((1+\sqrt{2})/2\approx 1.207\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mn>1</mn> <mo>+</mo> <msqrt> <mn>2</mn> </msqrt> <mo stretchy="false">)</mo> <mo stretchy="false">/</mo> <mn>2</mn> <mo>≈</mo> <mn>1.207</mn> </mrow> </math></EquationSource> </InlineEquation>. Additionally, we present a fully polynomial-time approximation scheme (FPTAS) and a pseudo-polynomial-time algorithm if the number of machines in the flow shop is fixed.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Flow shops with reentry: The total weighted completion time objective

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年7月1日

查看全文
  • Maximilian von Aspern,
  • Felix Buld,
  • Nicklas Klein,
  • Michael Pinedo

摘要

Flow shops are well-studied machine environments in which all jobs must visit all machines in the same order. While conventional flow shops assume that each job traverses the shop only once, many industrial environments require jobs to loop through the shop multiple times before completion. This means that after traversing the shop and completing its processing on the last machine, a job must return to the first machine and traverse the shop again until it has completed all its required loops. Such a setting, referred to as a flow shop with reentry, has numerous applications in industry, e.g., semiconductor manufacturing. The planning problem is to schedule all loops of all jobs while minimizing the total weighted completion time. In this paper, we consider reentrant flow shops with unit processing times. We show that this problem is strongly NP-hard if the number of machines is part of the input. We propose the Least Remaining Loops First (LRL) priority rule and show that it minimizes the total unweighted completion time. Then, we analyze the Weighted Least Remaining Loops First (WLRL) priority rule and show that it has a worst-case performance ratio of \((1+\sqrt{2})/2\approx 1.207\) ( 1 + 2 ) / 2 ≈ 1.207 . Additionally, we present a fully polynomial-time approximation scheme (FPTAS) and a pseudo-polynomial-time algorithm if the number of machines in the flow shop is fixed.