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

Authors: Farid Arfi; Jean-Michel Ilié; Djamel-Eddine Saidouni

Addresses: MISC Laboratory, Faculty of New Technologies of Information and Communication, University Constantine 2, Algeria ' LIP6 Laboratory, UPMC 4 place Jussieu 75005 Paris, France ' MISC Laboratory, Faculty of New Technologies of Information and Communication, University Constantine 2, Algeria

Abstract: 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.

Keywords: job shop scheduling; preemption; modelling; true concurrency; reachability; preemptive scheduling; reachability tree.

DOI: 10.1504/IJSPM.2016.078507

International Journal of Simulation and Process Modelling, 2016 Vol.11 No.3/4, pp.292 - 304

Available online: 19 Aug 2016 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article