Scholarlink

<p>We study a set of proportionate flow-shop scheduling problems with controllable processing times. In this setting all operations of a particular job have the same processing time, which is a function of the amount of resource allocated to the job. A solution to this set of problems is specified by the amount of resource allocated to each of the jobs, and by the job schedule on the machines. The quality of a solution is measured according to two criteria. The first is the total amount of resources allocated to the jobs, and the second is a regular scheduling criterion. The scheduling criteria we consider are the makespan and the total completion time. For each scheduling criterion, we developed an optimization algorithm that finds the entire set of Pareto-optimal solutions, assuming that the processing-time function is convex.</p>

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

Coordinating scheduling and resource allocation decisions in a proportionate flow-shop scheduling environment

  • 期刊论文

  • 发表日期：

    2026年1月23日

查看全文
  • Dvir Shabtay

摘要

We study a set of proportionate flow-shop scheduling problems with controllable processing times. In this setting all operations of a particular job have the same processing time, which is a function of the amount of resource allocated to the job. A solution to this set of problems is specified by the amount of resource allocated to each of the jobs, and by the job schedule on the machines. The quality of a solution is measured according to two criteria. The first is the total amount of resources allocated to the jobs, and the second is a regular scheduling criterion. The scheduling criteria we consider are the makespan and the total completion time. For each scheduling criterion, we developed an optimization algorithm that finds the entire set of Pareto-optimal solutions, assuming that the processing-time function is convex.