.png){kind=icon}
.png){kind=icon}
Return
Scheduling flow shops with operators
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2018.1425557.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper addresses the problem of assigning a number of operators, less than the number of machines, in a flow shop environment. We study two different problems. The first is the assignment of operators subject to a fixed job sequence; the second is on handling simultaneously the assignment of operators and the scheduling of jobs on the machines. We present complexity results and develop a new lower bound. Heuristic algorithms are designed for both problems. An experimental study is then conducted to evaluate the quality of our solving methods. The results show that the appropriate approach depends on the parameters of the problem, including the number of operators. The methods also provided results close to the theoretical lower bound in most of the cases.
Keywords:
scheduling
flow shop
operators
makespan
complexity analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W