Using combinatorial optimization methods for quantification scheduling

DOI10.1007/3-540-44798-9_24MaRDI QIDQ4787240zbMATH OpenFDO

Authors Pankaj Chauhan, Somesh Jha, James H. Kukula, Helmut Veith, Dong Wang, Edmund Clarke

Publication date 9 January 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2144/21440293

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• Optimal scheduling combinatorics
• Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms
• Evaluating typical algorithms of combinatorial optimization to solve continuous-time based scheduling problem
• Combinatorial optimization in real-time scheduling: Theory and algorithms
• Optimization applications in scheduling theory
• Hybrid optimization methods for time-dependent sequencing problems
• Solving combinatorial optimization problems in parallel: methods and techniques
• scientific article; zbMATH DE number 49948
• Time-optimal scheduling for high throughput screening processes using cyclic discrete event models
• Synthesizing optimization algorithms for scheduling partially ordered set of problems

Cited in

(3)

• Quantifier elimination by dependency sequents
• Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms
• Partial quantifier elimination and property generation

This page was built for publication: Using combinatorial optimization methods for quantification scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4787240)