点击次数：
论文类型：期刊论文
发表时间：2018-01-01
发表刊物：INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
收录刊物：SCIE、Scopus
卷号：56
期号：6
页面范围：2361-2369
ISSN号：0020-7543
关键字：flow shop; learning effect; scheduling; resource allocation; optimization
摘要：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.