Scholarlink

<p>In this paper, we study a new single machine group scheduling problem with learning effect, in which jobs are allowed to have different due dates. In addition, different jobs have different unit costs for earliness, tardiness, due date assignment, and flow time. By analyzing structural properties of optimal solutions of the problem, a polynomial time optimization algorithm is proposed for the case where jobs within each group have agreeable costs. Three heuristic algorithms are also proposed for the general case of the problem. Numerical results show that a tabu search heuristic algorithm with an extended neighborhood structure and the initial solution generated by SPT (shortest processing time first) rule effectively solves the general case of our problem.</p>

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

Optimal due date assignment in a single machine group technology scheduling environment with learning effect

  • 期刊论文

  • 发表日期：

    2026年3月7日

查看全文
  • Ying Chen,
  • Yongxi Cheng,
  • Jun Wu,
  • Guiqing Zhang

摘要

In this paper, we study a new single machine group scheduling problem with learning effect, in which jobs are allowed to have different due dates. In addition, different jobs have different unit costs for earliness, tardiness, due date assignment, and flow time. By analyzing structural properties of optimal solutions of the problem, a polynomial time optimization algorithm is proposed for the case where jobs within each group have agreeable costs. Three heuristic algorithms are also proposed for the general case of the problem. Numerical results show that a tabu search heuristic algorithm with an extended neighborhood structure and the initial solution generated by SPT (shortest processing time first) rule effectively solves the general case of our problem.