Abstract
Job shop Scheduling is classical combinational optimization technique generally used in manufacturing environment. The state of art of available for this technique was limited to static approach with single machine production shop only. But most the real world is dynamic where changes happen unexpectedly, which require dynamic job shop scheduling. One of the specific feature of dynamic job shop scheduling (DJSSS) is most of the problems are NP-hard and hence depends on approximation to optimize in computational times. This research paper will study the dynamic job shop scheduling for available scope research in this area. A specific research problem of immediate interested is formulated and objectives are set forth to solve it. Such solution will pave a way for experimental implementation of job shop scheduling technique in multi machine dynamic job shop. Keywords: Job shop scheduling, dynamic scheduling, ant colony optimization, task optimization.
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: International Journal of Advanced Research in Computer Science
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.
