Scheduling identical parallel machines with tooling constraints

Andreza Cristina Beezão, Jean François Cordeau, Gilbert Laporte, Horacio Hideki Yanasse

Research output: Contribution to journalArticlepeer-review

62 Citations (SciVal)


We model and solve the problem of sequencing a set of jobs with specified processing times and tool requirements on a set of identical parallel machines. Decisions concern the assignment of jobs to machines, their sequencing, and the allocation of tools on each machine. The objective function minimizes the makespan. We propose two mathematical formulations of the problem and an adaptive large neighborhood search metaheuristic in which the destroy and repair operators exploit the structures of two well-known and related combinatorial optimization problems, namely the parallel machine scheduling problem and the job sequencing and tool switching problem on a single machine. Computational experiments conducted on two data sets of 1440 instances show that our algorithm produces excellent results and outperforms existing heuristics.

Original languageEnglish
Pages (from-to)834-844
Number of pages11
JournalEuropean Journal of Operational Research
Issue number3
Publication statusPublished - 16 Mar 2017


  • Adaptive large neighborhood search
  • Flexible manufacturing systems
  • Parallel machines
  • Sequence-dependent setup times
  • Tooling constraints

ASJC Scopus subject areas

  • General Computer Science
  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management


Dive into the research topics of 'Scheduling identical parallel machines with tooling constraints'. Together they form a unique fingerprint.

Cite this