Simulation optimization for a flexible jobshop scheduling problem using an estimation of distribution algorithm
| Autor: | S. Jöns, Carlos Alberto-Ochoa, Arturo Hernández-Aguirre, Ricardo Pérez-Rodríguez |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Schedule
Sequence Mathematical optimization Job shop scheduling Computer science Mechanical Engineering Scheduling (production processes) Flow shop scheduling Work in process Industrial and Manufacturing Engineering Computer Science Applications Scheduling (computing) Task (computing) Idle Constant (computer programming) Estimation of distribution algorithm Control and Systems Engineering Software |
| Zdroj: | The International Journal of Advanced Manufacturing Technology. 73:3-21 |
| ISSN: | 1433-3015 0268-3768 |
| DOI: | 10.1007/s00170-014-5759-x |
| Popis: | The flexible jobshop scheduling problem permits the operation of each job to be processed by more than one machine. The idea is to assign the processing sequence of operations on the machines and the assignment of operations on machines such that the system objectives can be optimized. The assignment mentioned is a difficult task to implement on real manufacturing environments because there are many assumptions to satisfy, especially when the amount of work is not constant or sufficient to keep the manufacturing process busy for a long time, causing intermittent idle times. An estimation of distribution algorithm-based approach coupled with a simulation model is developed to solve the problem and implement the solution. Using the proposed approach, the shop performance can be noticeably improved when different machines are assigned to different schedules. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|