抄録
A job-shop scheduling problem is formulated in order to consistently manage every production equipment such as machine tool, assembly robot, AGV, storehouse, material shelf, and so on. In this paper, the scheduling problem is formulated as Mixed-Integer Programming focusing on finite capacity buffers. The validity of proposed formulation is evaluated by a commercially available optimization software.
