Séminaire conjoint CIRRELT-Chaire de recherche du Canada en distributique-Chaire de recherche du Canada en logistique et en transport
TITRE : An adaptive large neighborhood search heuristic for the parallel machine problem with tooling constraints (PMTC)
CONFÉRENCIER : Andreza C. Beezão, University of São Paulo, Brésil
DATE et ENDROIT : 4 septembre 2014, 10h30, salle 5441, Pavillon André-Aisenstadt, Campus de l’Université de Montréal
RESPONSABLE : Jean-François Cordeau
RÉSUMÉ : The problem of processing a set of jobs with given processing times and tool requirement on a set of identical parallel machines is addressed. Decision variables regard the assignment of jobs to machines, the job sequencing and the tool allocation, and the objective function minimizes the makespan, that is, the total completion time of all jobs. We propose an adaptive large neighborhood search heuristic in which the operators exploit structures of two well known optimization problems related to the PMTC, namely the parallel machine problem and the tool switching problem on a single machine. Numerical results are presented.