抄録
We study two machine shop type scheduling problem in this paper. At
shop type scheduling, one job is handled by plural machines. And it generally divided
two types of problem. Flowshop type have been determined the order of operation at
each machine. And it is not decided on Openshop type. In this paper, considering a
problem with two machines and flexible jobs which have no strict order of machines,
but have desirably order. The super shop problem which is mixed with flow shop and
open shop is considered by Strusevich and suggests a solution method that based on
13 cases. In this paper, we extend this result and give more detailed condition on one
case which include preemptive job. We also propose a solution to this problem by
extending this result to flexible flowshop.
