期刊
ENGINEERING OPTIMIZATION
卷 52, 期 7, 页码 1184-1197出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/0305215X.2019.1638920
关键词
Scheduling; group technology; resource allocation; single machine; deteriorating job
资金
- Support Program for Innovative Talents in Liaoning University [LR2016017]
- Liaoning BaiQianWan Talents Program
- National Natural Science Foundation of China [71871091, 71673082]
This article deals with a single-machine resource allocation scheduling problem with deteriorating jobs. Under a group technology environment, the actual processing times of jobs are a convex resource allocation function of their starting time and the amount of resource allocation. The objective is to minimize the weighted sum of makespan and resource allocation cost. For two special cases, it is proved that the problem can be solved in polynomial time. For the general case of the problem, heuristic and branch-and-bound procedures are developed to solve the problem. Computational experiments are also performed to examine the effectiveness and the efficiency of the algorithms.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据