Job-Shop Scheduling Using Timed Automata?

Yasmina Abdeddaïm; Oded Maler

doi:10.1007/3-540-44585-4_46

ScienceGate Book Chapters

BOOK-CHAPTER

Job-Shop Scheduling Using Timed Automata?

Yasmina Abdeddaïm Oded Maler

Year: 2001 Lecture notes in computer science Pages: 478-492 Publisher: Springer Science+Business Media

DOI: 10.1007/3-540-44585-4_46

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science Automaton Job shop scheduling Heuristics Shortest path problem Schedule Scheduling (production processes) Benchmark (surveying) Job shop Mathematical optimization Theoretical computer science Flow shop scheduling Mathematics Graph

Metrics

Cited By

6.99

FWCI (Field Weighted Citation Impact)

Refs

0.97

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Formal Methods in Verification

Physical Sciences → Computer Science → Computational Theory and Mathematics

Scheduling and Optimization Algorithms

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Petri Nets in System Modeling

Physical Sciences → Computer Science → Computational Theory and Mathematics

Job-Shop Scheduling Using Timed Automata?

Metrics

Citation History

Topics

Related Documents

Job-Shop Scheduling Problems Using Timed Planning

Preemptive Job-Shop Scheduling Using Stopwatch Automata

Solving Job Shop Scheduling Problem Using Cellular Learning Automata

Using timed petri nets for the scheduling of job-shop systems

Optimal scheduling using priced timed automata