Abstract
A scheduling problem is formulated focusing on jobs stored in production resources in the present paper. In a production system with finite buffer capacity, the job are stored in not only buffers but also production resources such as machine tools and assembly robots. Therefore, successive jobs cannot be processed by the resources until the previous jobs are removed from them. In such a scheduling problem, certain processing orders of jobs are infeasible because start times and release times of the jobs can not be determined. The graph representation method for conventional scheduling problems is extended in order to judge feasibility of the present schedules, in which the jobs stored in the resources are taken into account. A local searching method is applied to improve the schedules of the production systems with finite buffer capacity. It gives an appropriate schedule in combination with the dispatching procedure proposed in the first report.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
