BOOK-CHAPTER

Preemptive Job-Shop Scheduling Using Stopwatch Automata

Yasmina AbdeddaïmOded Maler

Year: 2002 Lecture notes in computer science Pages: 113-126   Publisher: Springer Science+Business Media
Keywords:
Stopwatch Computer science Job shop scheduling Automaton Heuristics Undecidable problem Shortest path problem Deterministic automaton Scheduling (production processes) Theoretical computer science Algorithm Mathematical optimization Mathematics Graph Schedule

Metrics

70
Cited By
4.20
FWCI (Field Weighted Citation Impact)
15
Refs
0.95
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
Petri Nets in System Modeling
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Real-Time Systems Scheduling
Physical Sciences →  Computer Science →  Hardware and Architecture

Related Documents

BOOK-CHAPTER

Job-Shop Scheduling Using Timed Automata?

Yasmina AbdeddaïmOded Maler

Lecture notes in computer science Year: 2001 Pages: 478-492
JOURNAL ARTICLE

Resource Constraints for Preemptive Job-shop Scheduling

Claude Le PapePhilippe Baptiste

Journal:   Constraints Year: 1998 Vol: 3 (4)Pages: 263-287
JOURNAL ARTICLE

Solving preemptive job-shop scheduling problems using a true concurrency model

Farid ArfiJean‐Michel IliéDjamel Eddine Saïdouni

Journal:   International Journal of Simulation and Process Modelling Year: 2016 Vol: 11 (3/4)Pages: 292-292
© 2026 ScienceGate Book Chapters — All rights reserved.