期刊
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
卷 56, 期 6, 页码 2361-2369出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2017.1371353
关键词
flow shop; learning effect; scheduling; resource allocation; optimization
资金
- National Natural Science Foundation of China [71672019, 71271039, 71471057, 71501082]
- New Century Excellent Talents in University [NCET-13-0082]
We consider a two-machine no-wait permutation flow shop common due date assignment scheduling problem where the processing time of a job is given as a function of its position in the sequence and its amount of resource allocated to this job. The common due date (CON) assignment method means that all the jobs are given a common due date. We need to make a decision on the common due date, resource allocation and the sequence of jobs to minimise total earliness, tardiness, common due date cost and total resource cost. We show that the problem remains polynomially solvable under the proposed model.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据