Automatic Translation of Blocking Flexible Job Shop Scheduling Problems to Automata Using the Supervisory Control Theory
- 14 October 2023
- journal article
- research article
- Published by Springer Nature in Journal of Control, Automation and Electrical Systems
- Vol. 35 (1) , 12-23
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Scheduling2016
- An iterated greedy metaheuristic for the blocking job shop scheduling problemJournal of Heuristics, 2015
- Job-shop scheduling with blocking and no-wait constraintsEuropean Journal of Operational Research, 2002
- Introduction to automata theory, languages, and computation, 2nd editionACM SIGACT News, 2001
- Tabu search for the job-shop scheduling problem with multi-purpose machinesOR Spectrum, 1994
- Routing and scheduling in a flexible job shop by tabu searchAnnals of Operations Research, 1993
- A Computational Study of the Job-Shop Scheduling ProblemINFORMS Journal on Computing, 1991
- The control of discrete event systemsProceedings of the IEEE, 1989
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979