No abstract

No abstract

No abstract

No abstract

A mixed shop is a manufacturing infrastructure designed to process a mixture of a set of flowshop jobs and a set of open-shop jobs. Mixed shops are in general much more complex to schedule than flow-shops and open-shops, and have been studied since the 1980's. We consider the three machine proportionate mixed shop problem denoted as M 3 | prpt | C max , in which each job has equal processing times on all three machines. Koulamas and Kyparisis [European Journal of Operational Research, 243:70-74,2015] showed that the problem is solvable in polynomial time in some very special cases; for the non-solvable case, they proposed a 5/3-approximation algorithm. In this paper, we present an improved 4/3-approximation algorithm and show that this ratio of 4/3 is asymptotically tight; when the largest job is a flow-shop job, we present a fully polynomialtime approximation scheme (FPTAS). On the negative side, while the F 3 | prpt | C max problem is polynomial-time solvable, we show an interesting hardness result that adding one open-shop job to the job set makes the problem NP-hard if this open-shop job is larger than any flow-shop job. We are able to design an FPTAS for this special case too. Figure 5.1: A feasible schedule π for the constructed instance of the M 3 | prpt | C max problem, when the set S can be partitioned into two equal parts S 1 and S 2 . The partition of the flow-shop jobs {J 1 , J 2 } is correspondingly constructed. In the schedule, the jobs of J 1 and the jobs of J 2 are processed in the LPT order, respectively.