Convex resource allocation scheduling in the no-wait flowshop with common flow allowance and learning effect

Abstract

We study the problem of two-machine no-wait flowshop scheduling with learning effect and convex resource-dependent processing times. Under the condition of the due-date assignment with common flow allowance (i.e. slack (SLK) due-date assignment), we provide a bi-criteria analysis where the first criterion is to minimise the scheduling criteria (i.e. the weighted sum of earliness, tardiness and flow allowance costs), and the second criterion is to minimise the resource consumption cost (i.e. the weighted sum of resource consumption cost). The objective is to determine the optimal job sequence, resource allocations and common (flow allowance) slack time that minimise the three different versions of the two criteria. We prove that these problems can be solved in polynomial time.

Keywords:

• scheduling
• JIT
• flowshop
• resource allocation
• learning effects

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

This research was supported by the Natural Science Foundation of Shaanxi (2017JM7009), the National Science Foundation of China (31701150, 71471120, 71502026), the Fundamental Research Funds for the Central Universities (CXTD2017003), the Young Talent Scheme of Xi'an Jiaotong University, China, and the Support Program for Innovative Talents in Liaoning University (LR2016017). The Liaoning BaiQianWan Talents Program also sponsored this research.