OUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMES
2014 ◽
Vol 31
(04)
◽
pp. 1450028
◽
Keyword(s):
We consider m-machine permutation flow shop problems with an outsourcing option for a special case where each job's processing time equals the job's processing requirement plus a characteristic value of the machine. The objective is to minimize the sum of the performance measure for in-house jobs (the total completion time or the makespan) and the total outsourcing cost. We prove that two problems are polynomially solvable when the number of machines is fixed.
2020 ◽
Vol 33
(1)
◽
2010 ◽
Vol 1
(1)
◽
pp. 1-10
◽
2013 ◽
Vol 6
(4)
◽
pp. 7-15
2020 ◽
pp. 281-298
◽