Scholarlink

<p>We consider a two-machine permutation flow shop scheduling problem with generalized due dates to minimize total late work. Note that in our problem, a due date is given based on a specific position instead of a specific job. First, we analyze how the computational complexity varies depending on the structure of the processing times. Then, we present a mixed-integer programming model, two heuristics, and a branch-and-bound algorithm. Finally, we conduct numerical experiments and recommend which solution approach should be applied in which case.</p>

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

Two-machine permutation flow shop scheduling with generalized due dates to minimize total late work

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年4月1日

查看全文
  • Byung-Cheon Choi,
  • Myoung-Ju Park,
  • Kyung Min Kim

摘要

We consider a two-machine permutation flow shop scheduling problem with generalized due dates to minimize total late work. Note that in our problem, a due date is given based on a specific position instead of a specific job. First, we analyze how the computational complexity varies depending on the structure of the processing times. Then, we present a mixed-integer programming model, two heuristics, and a branch-and-bound algorithm. Finally, we conduct numerical experiments and recommend which solution approach should be applied in which case.