Solving preemptive job-shop scheduling problems using a true concurrency model - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Simulation and Process Modelling Année : 2016

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

Résumé

A true concurrency model called stopwatch durational action timed automata (S-DATA) is proposed to model preemptive timed concurrent systems. We demonstrate its usefulness in tackling the preemptive job-shop scheduling problem (PJSSP). This yields a compact reachability tree representing the possible schedules such that the durations and preemptions of the scheduled actions are dynamically managed. Different techniques are demonstrated to reduce the space search over such reachability tree, preserving the optimal schedules of the problem. The efficiency of approach is tested on a number of well-known benchmark problems and compared with the best method of scheduling in common use.
Fichier non déposé

Dates et versions

hal-01365356 , version 1 (13-09-2016)

Identifiants

Citer

Farid Arfi, Jean-Michel Ilié, Djamel Eddine Saïdouni. Solving preemptive job-shop scheduling problems using a true concurrency model. International Journal of Simulation and Process Modelling, 2016, 11 (3/4), ⟨10.1504/IJSPM.2016.078507⟩. ⟨hal-01365356⟩
175 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More