Scheduling job shop problems with operators with respect to the maximum lateness
Keyword(s):
Job Shop
◽
This paper deals with the problem of assigning operators to jobs, within a free assignment-changing mode, in a job-shop environment subject to a fixed processing sequence of the jobs. We seek an assignment of operators that minimizes the maximum lateness. Within this model, a job needs an operator during the entire duration of its processing. We show that the problem is 𝒩𝒫-hard when the number of operators is arbitrary and exhibit polynomial time algorithms for the cases involving one and two operators, respectively.
1993 ◽
Vol 14
(2)
◽
pp. 99-109
◽
2007 ◽
pp. 272-284
◽
2021 ◽
pp. 1-20
Keyword(s):
2012 ◽
Vol 2012
◽
pp. 1-19
◽
2015 ◽
Vol 12
(3)
◽
pp. 1057-1073
Keyword(s):
2005 ◽
pp. 225-236
◽