Research on common due window assignment flowshop scheduling with learning effect and resource allocation

ABSTRACT

In this article, the two-machine no-wait permutation flowshop scheduling problem with common due window assignment, learning effect and resource allocation is considered, wherein learning effect and resource allocation mean that the processing time of a job is a function of its position in a sequence and its amount of resource allocation. According to the common due window assignment method, each job is associated with a common due window, which is a decision variable. The goal is to determine the sequence of jobs, common due window starting time, due window size and resource allocation such that the linear weighted sum of job earliness, tardiness, due window size and resource cost is minimized. This article shows that the scheduling problem can be solved in polynomial time.

KEYWORDS:

• Flowshop
• learning effect
• two-machine
• resource allocation
• common due window assignment

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

This research was supported by the Support Program for Innovative Talents in Liaoning University of China [grant no. LR2016017]; the Liaoning BaiQianWan Talents Program of China; and the Foundation of the Education Department of Liaoning (China) [L201753].