Abstract
This paper presents a family of sub-optimal algorithms based on the A* heuristic search algorithm, aimed at solving the general job-shop scheduling problem. A methodology is suggested for algorithms that require adjustable memory resources, by compromising algorithmic admissibility. Different possibilities for (admissible or non-admissible) heuristic estimates are suggested and dynamically weighted heuristics are introduced to the job-shop scheduling problem, with good results. Bottleneck scheduling is introduced within this problem-solving scheme, proving a base for more powerful heuristics. In terms of solution nearness to optimal and speed, the techniques investigated generally compare favourably with similar work in this field.
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 International Journal of Advanced Manufacturing Technology
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.
