Multiple priority dispatching rules for the job shop scheduling problem

Author

Zahmani, Mohamed Habib ; Atmani, Baghdad ; Bekrar, Abdelghani ; Aissani, Nassima

Author_Institution

LMPA, Univ. of Mostaganem, Algeria

fYear

2015

fDate

25-27 May 2015

Firstpage

1

Lastpage

6

Abstract

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.

Keywords

data mining; database management systems; digital simulation; inference mechanisms; job shop scheduling; learning (artificial intelligence); optimisation; DR; JSSP; inference model; job shop scheduling problem; learning database construction; makespan optimization; priority dispatching rule; simulation model; Data mining; Data models; Databases; Dispatching; Job shop scheduling; Object recognition; Optimization; Dispatching Rules; Job Shop Scheduling; Learning Database; Makespan; Simulation;

fLanguage

English

Publisher

ieee

Conference_Titel

Control, Engineering & Information Technology (CEIT), 2015 3rd International Conference on

Conference_Location

Tlemcen

Type

conf

DOI

10.1109/CEIT.2015.7232991

Filename

7232991