Viewing scheduling as an opportunistic problem-solving process
Annals of Operations Research
Linear-space best-first search
Artificial Intelligence
A branch and bound algorithm for the job-shop scheduling problem
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
A classical mind
Proceedings of the DIMACS workshop on Partial order methods in verification
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Parallel state space construction for model-checking
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Handbook of Process Algebra
Process Algebra with Timing
Distributed-Memory Model Checking with SPIN
Proceedings of the 5th and 6th International SPIN Workshops on Theoretical and Practical Aspects of SPIN Model Checking
Efficient Guiding Towards Cost-Optimality in UPPAAL
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Exploring Very Large State Spaces Using Genetic Algorithms
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Distributing Timed Model Checking - How the Search Order Matters
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
µCRL: A Toolset for Analysing Algebraic Specifications
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
The Murphi Verification System
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Distributed State Space Generation of Discrete-State Stochastic Models
INFORMS Journal on Computing
Quantitative Analysis and Model Checking
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Annals of Mathematics and Artificial Intelligence
The harpy speech recognition system.
The harpy speech recognition system.
The argos image understanding system.
The argos image understanding system.
Constraint-directed search: a case study of job-shop scheduling
Constraint-directed search: a case study of job-shop scheduling
Directed explicit-state model checking in the validation of communication protocols
International Journal on Software Tools for Technology Transfer (STTT)
Queueing Networks and Markov Chains
Queueing Networks and Markov Chains
From "t to µCRL: Combining Performance and Functional Analysis
ICECCS '05 Proceedings of the 10th IEEE International Conference on Engineering of Complex Computer Systems
Solving scheduling problems by untimed model checking: the clinical chemical analyser case study
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
Scheduling cluster tools using filtered beam search and recipe comparison
WSC '05 Proceedings of the 37th conference on Winter simulation
Optimal scheduling using branch and bound with SPIN 4.0
SPIN'03 Proceedings of the 10th international conference on Model checking software
Parallel external directed model checking with linear i/o
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Survey on Directed Model Checking
Model Checking and Artificial Intelligence
| Hi-index | 0.00 |
In this paper, we mainly focus on solving scheduling problems with model checking, where a finite number of entities needs to be processed as efficiently as possible, for instance by a machine. To solve these problems, we model them in untimed process algebra, where time is modelled using a special tickaction. We propose a set of distributed state space explorations to find schedules for the modelled problems, building on the traditional notion of beam search. The basic approach is called distributed (detailed) beam search, which prunes parts of the state space while searching using an evaluation function in order to find near-optimal schedules in very large state spaces. Variations on this approach are presented, such as distributed flexible, distributed g-synchronised, and distributed prioritybeam search, which can also practically be used in combinations.