Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods

DOI10.1051/ro/2015013zbMath1333.90114OpenAlexW2083615347MaRDI QIDQ2798117

Rachid Zitouni, Omar Selt

Publication date: 1 April 2016

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2015013

zbMATH Keywords

schedulingtabu searchmetaheuristicparallel identical machinesunavailability periods

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Minimizing the number of tardy jobs for \(m\) parallel machines
• Scheduling with release dates on a single machine to minimize total weighted completion time
• Two-machine flowshop scheduling with availability constraints
• Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
• Guidelines for the use of meta-heuristics in combinatorial optimization.
• Tabu search and finite convergence
• Future paths for integer programming and links to artificial intelligence
• Minimizing the weighted number of tardy jobs on parallel processors
• Scheduling with limited machine availability
• Machine scheduling with an availability constraint
• Scheduling on semi-identical processors
• A branch-and-bound-based local search method for the flow shop problem
• Scheduling jobs and maintenance activities on parallel machines
• Unnamed Item

This page was built for publication: Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods