Proportionate flowshop scheduling with position-dependent weights

ABSTRACT

This article addresses proportionate flowshop scheduling problems with position-dependent weights wherein the weight is not related to the job but to the position in which the job is scheduled. Common and slack due date assignment models are discussed under a due date assignment framework. The goal is to determine a feasible schedule for all jobs and due dates of all jobs to minimize a total cost function wherein the objective function is of the minsum type. Optimal properties for the problems are proposed, based on which polynomial time algorithms are provided to solve these two problems optimally.

KEYWORDS:

• Scheduling
• flowshop
• due date assignment
• position-dependent weights

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

This research was supported by the following project funding: the National Social Science Foundation of China [grant no. 17BTY049]; the Support Program for Innovative Talents in Liaoning University of China [grant no. LR2016017]; and, under the Liaoning BaiQianWan Talents Program of China, the Foundation of the Education Department of Liaoning (China) [grant no. L201753] and the Program for Liaoning Natural Science Foundation Research (China) [grant no. 201601177].