Abstract

This paper extends the traditional job shop scheduling problem (JSP) by incorporating the routing and scheduling decisions of the material handling equipment. It provides a generic definition and a mixed integer linear programming model for the problem considering the case of heterogeneous multiple-load material handling equipment. A constructive heuristic is developed for solving the problem. This heuristic is based on the well-known Giffler and Thompson’s algorithm for the JSP with modifications that account for the routing decisions of the material handling equipment and their effect on the start times of the manufacturing operations. Different dispatching rules are integrated into the heuristic, and experiments are conducted to study their effect on the makespan along with the determination of the computational time requirements of the developed heuristic.

Full Text
Published version (Free)

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 call