Iterated Local Search with Path Relinking for Solving Parallel Machines Scheduling Problem with Resource-Assignable Sequence Dependent Setup Times

2010 ◽  
pp. 107-118 ◽  
Author(s):  
Edmar Hell Kampke ◽  
José Elias Claudio Arroyo ◽  
André Gustavo Santos
Keyword(s):  
Local Search ◽  
Parallel Machines ◽  
Iterated Local Search ◽  
Setup Times ◽  
Path Relinking ◽  
Scheduling Problem ◽  
Parallel Machines Scheduling ◽  
Sequence Dependent Setup ◽  
Dependent Setup Times ◽  
Sequence Dependent Setup Times

scholarly journals Workforce influence on manufacturing machines schedules

2020 ◽  
Author(s):  
Pierpaolo Caricato ◽  
Antonio Grieco ◽  
Anna Arigliano ◽  
Luciano Rondone
Keyword(s):  
Human Resources ◽  
Parallel Machines ◽  
Setup Times ◽  
Planning Problem ◽  
Scheduling Problem ◽  
Sequence Dependent ◽  
Parallel Machines Scheduling ◽  
Sequence Dependent Setup ◽  
Dependent Setup Times ◽  
Sequence Dependent Setup Times

Abstract This study addresses a parallel machines scheduling problem with sequence-dependent setup times and additional resource constraints related to workforce management. In most industrial cases, the execution of jobs requires the involvement of human resources in addition to machines: this work addresses the many complications due to workforce-specific issues that arise in a real industrial application. This is achieved separating the complex yet classical parallel machines scheduling problem with sequence-dependent setup times from the additional human resources planning problem: the former is formulated and solved through constraint programming, while an ad hoc procedure is provided for the latter. An Italian specialized firm, Prosino S.r.l., provides the industrial case to both validate the adequacy of the adopted method to the actual industrial problem and test the effectiveness of the proposed approach. Computational results obtained over six months of experimentation at the partner firm are presented.

Sign in / Sign up

Export Citation Format

Share Document