No-wait resource allocation flowshop scheduling with learning effect under limited cost availability

Abstract This article considers the no-wait flowshop scheduling with learning effect and resource allocation on two-machine. Our goal is to find the optimal resource allocations and job sequence that minimize the scheduling criterion (the total weighted resource consumption) subject to the constrain...

Full description

Saved in:
Bibliographic Details
Published inComputer journal Vol. 62; no. 1; pp. 90 - 96
Main Authors Tian, Yu, Xu, Ming, Jiang, Chong, Wang, Ji-Bo, Wang, Xiao-Yuan
Format Journal Article
LanguageEnglish
Published Oxford University Press 01.01.2019
Subjects
scheduling
no-wait
flowshop
controllable job processing times
learning effect
Online AccessGet full text

Cover

More Information
Summary:Abstract This article considers the no-wait flowshop scheduling with learning effect and resource allocation on two-machine. Our goal is to find the optimal resource allocations and job sequence that minimize the scheduling criterion (the total weighted resource consumption) subject to the constraint that the total weighted resource consumption (the scheduling criterion) is less than or equal to a given constant, where the schedule criteria include weighted makespan, total completion (waiting) time and total absolute differences in completion (waiting) times. We show that these two problems are polynomially solvable respectively.
ISSN:0010-4620
1460-2067
DOI:10.1093/comjnl/bxy034