Scholarlink

<p>Simultaneous optimization makespan and the maximum cost on a unbounded series-batching machine is studied in the paper, in which each job contains a specific component and standard component. Specific components are scheduled separately, while standard components are scheduled in batches. Completing a job means that its two components have been completed. The two components of a job can be scheduled in any order. We present an <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(O(n^{4})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>O</mi> <mo stretchy="false">(</mo> <msup> <mi>n</mi> <mn>4</mn> </msup> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>-time algorithm for the simultaneous optimization problem.</p>

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

Bicriteria Scheduling with Two-Component Jobs on an Unbounded Series-Batching Machine

  • 期刊论文

  • 发表日期：

    2025年12月11日

查看全文
  • Cheng He,
  • Jing Wu,
  • Hui Guo,
  • Bing-Ru Sun,
  • Hao Lin,
  • Yuan Zhang

摘要

Simultaneous optimization makespan and the maximum cost on a unbounded series-batching machine is studied in the paper, in which each job contains a specific component and standard component. Specific components are scheduled separately, while standard components are scheduled in batches. Completing a job means that its two components have been completed. The two components of a job can be scheduled in any order. We present an \(O(n^{4})\) O ( n 4 ) -time algorithm for the simultaneous optimization problem.