The Proceedings of Manufacturing Systems Division Conference
Online ISSN : 2424-3108
2005
Session ID : 2102
Conference information
2102 Job-shop Scheduling Problem with Finite Capacity Buffers A Case of Mixed-Integer Programming Model
Rei HINO[in Japanese][in Japanese]
Author information
CONFERENCE PROCEEDINGS FREE ACCESS

Details
Abstract
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.
Content from these authors
© 2005 The Japan Society of Mechanical Engineers
Previous article Next article
feedback
Top