Abstract
A true concurrency model called stopwatch durational action timed automata (S-DATA) is proposed to model preemptive timed concurrent systems. We demonstrate its usefulness in tackling the preemptive job-shop scheduling problem (PJSSP). This yields a compact reachability tree representing the possible schedules such that the durations and preemptions of the scheduled actions are dynamically managed. Different techniques are demonstrated to reduce the space search over such reachability tree, preserving the optimal schedules of the problem. The efficiency of approach is tested on a number of well-known benchmark problems and compared with the best method of scheduling in common use.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Simulation and Process Modelling
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.