A genetic algorithm approach for a constrained employee scheduling problem as applied to employees at mall type shops

Author(s):  
Adrian Brezulianu ◽  
Monica Fira ◽  
Lucian Fira
2013 ◽  
Vol 26 (7) ◽  
pp. 1761-1771 ◽  
Author(s):  
Adnen El Amraoui ◽  
Marie-Ange Manier ◽  
Abdellah El Moudni ◽  
Mohamed Benrejeb

Author(s):  
Kazuhiro ASHIZAWA ◽  
Hitoshi IIMA ◽  
Nobuo SANNOMIYA ◽  
Kagayaki SUZUKI ◽  
Yasunori KOBAYASHI

Author(s):  
Marcell S. Kalman ◽  
Omar G. Rojas ◽  
Elias Olivares-Benitez ◽  
Samuel Moisés Nucamendi-Guillén

A MILP and genetic algorithm optimization model for the sequencing of jobs in a medium-sized factory, dedicated to the manufacturing of home furniture, where different categories and types of articles are produced and whose routes and manufacturing processing times vary widely, are proposed. Different scenarios are considered for the objective function based on minimizing makespan and tardiness. The results of the optimization for an instance of 24 jobs on five machines, chosen as a representative instance of the order sizes that are handled by the company, show important reductions in the productive system's usage times, oscillating between 10% and 20% with respect to a random initial sequence in the production plan. Improvements were similar in both techniques, the main difference being the solution time of each one.


Sign in / Sign up

Export Citation Format

Share Document