Abstract
Job-shop Scheduling Problem (JSP) is one of the representative combinatorial optimization problems where the objective is to find an ideal assignment of resources when multiple tasks must be processed simultaneously. Many heuristic methods for the JSP has been proposed. Among them, dispatching rules can provide a feasible schedule within a relatively short time. However, the obtained schedule is usually insufficient and further improvement by other heuristics is needed. Sub-problem is defined by assignments of resources within an arbitrary selected time window and rule-based reconstruction is performed by solving the sub-problem with a dispatching rule. An approprate set of time window and dispatching rule is obtained by genetic algorithm. This rule-based reconstruction procedure is combined with tabu search algorithm. The experiments are shows that the proposed algorithm performs better than an existing heuristic method when the number of tasks is much larger than the number of resources.
Sign-in/Register to access full text options 
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: The Proceedings of JSME annual Conference on Robotics and Mechatronics (Robomec)
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.
