Hits:

Indexed by:期刊论文

Date of Publication:2018-01-01

Journal:INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH

Included Journals:SCIE、Scopus

Volume:56

Issue:6

Page Number:2361-2369

ISSN No.:0020-7543

Key Words:flow shop; learning effect; scheduling; resource allocation; optimization

Abstract: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.