Multiple priority dispatching rules for the job shop scheduling problem

Mohamed Habib Zahmani (1) , Baghdad Atmani (2) , Abdelghani Bekrar (3) , Nassima Aissani (2)

1 University of Mostaganem, Mostaganem, Algeria
2 LIO - Laboratoire d'Informatique d'Oran
3 LAMIH - Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201

In this paper we focus on the Job Shop Scheduling Problem (JSSP) using Priority Dispatching Rules. Simulation model for makespan optimization is proposed using different Dispatching Rules (DR) for each machine in the shop floor. Collected results are used for learning base construction. This database will be used to develop an inference model able to select the best DR for every new scheduling problem. This preliminary study shows advantages of using different DR and also saving progress JSSP data

Mots clés: "Job Shop Scheduling"; "Simulation"; "Dispatching Rules"; "Makespan"; "Learning Database"

Domaines: Automatique / Robotique

Mohamed Habib Zahmani, Baghdad Atmani, Abdelghani Bekrar, Nassima Aissani. Multiple priority dispatching rules for the job shop scheduling problem. 2015 3rd International Conference on Control, Engineering & Information Technology (CEIT), May 2015, Tlemcen, Algeria. pp.1-6, ⟨10.1109/CEIT.2015.7232991⟩. ⟨hal-03417079⟩