Back to Search
Start Over
Multiple priority dispatching rules for the job shop scheduling problem
- Source :
- 2015 3rd International Conference on Control, Engineering & Information Technology (CEIT), 2015 3rd International Conference on Control, Engineering & Information Technology (CEIT), May 2015, Tlemcen, Algeria. pp.1-6, ⟨10.1109/CEIT.2015.7232991⟩
- Publication Year :
- 2015
- Publisher :
- HAL CCSD, 2015.
-
Abstract
- International audience; 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
- Subjects :
- 0209 industrial biotechnology
021103 operations research
Operations research
Job shop scheduling
Computer science
business.industry
0211 other engineering and technologies
Inference
02 engineering and technology
Flow shop scheduling
Dynamic priority scheduling
Job shop scheduling problem
Machine learning
computer.software_genre
Data modeling
[SPI.AUTO]Engineering Sciences [physics]/Automatic
"Makespan"
020901 industrial engineering & automation
"Dispatching Rules"
"Simulation"
"Learning Database"
Artificial intelligence
business
computer
"Job Shop Scheduling"
Subjects
Details
- Language :
- English
- Database :
- OpenAIRE
- Journal :
- 2015 3rd International Conference on Control, Engineering & Information Technology (CEIT), 2015 3rd International Conference on Control, Engineering & Information Technology (CEIT), May 2015, Tlemcen, Algeria. pp.1-6, ⟨10.1109/CEIT.2015.7232991⟩
- Accession number :
- edsair.doi.dedup.....ea9311129635f80a43b5efc4db31d273
- Full Text :
- https://doi.org/10.1109/CEIT.2015.7232991⟩