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.
International audienceManufacturing firms must often consider how to plan the production of a new order, containing the impact on the existing plan. Two approaches are typically used to solve the problem: online scheduling and rescheduling. State of the art for both strategies is analyzed and methods available in the literature are proved to be inefficient for real world cases coming from production planning problems in a manufacturing firm. We propose an alternative approach combining the most effective aspects of both traditional approaches. The already available production plan and the characteristics of the new order to be planned are studied and used in order to generate a new production plan. Constraint programming is used to implement the proposed approach. Results on case studies are also provided to evaluate the effectiveness of the proposed approach