Scholarlink

<p>In this article, we investigate the single-machine scheduling with variable (i.e., position-dependent and time-dependent) processing times and past-sequence-dependent delivery times. Under the common, slack, and different due dates, whose goal is to determine the optimal due dates and optimal job sequence such that the weighted sum of earliness, tardiness, number of early and delayed jobs and due dates assignment cost is minimized, where the weights are position-dependent. Exploiting the optimal solution properties, it is showed that the problem can be solved in polynomial time under different versions of variable processing times and due date assignments.</p>

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

Delivery Scheduling with Variable Processing Times and Due Date Assignments

  • 期刊论文

  • 发表日期：

    2025年3月24日

查看全文
  • Xuyin Wang,
  • Weiguo Liu

摘要

In this article, we investigate the single-machine scheduling with variable (i.e., position-dependent and time-dependent) processing times and past-sequence-dependent delivery times. Under the common, slack, and different due dates, whose goal is to determine the optimal due dates and optimal job sequence such that the weighted sum of earliness, tardiness, number of early and delayed jobs and due dates assignment cost is minimized, where the weights are position-dependent. Exploiting the optimal solution properties, it is showed that the problem can be solved in polynomial time under different versions of variable processing times and due date assignments.