Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness

DOI10.1016/j.apm.2011.02.035zbMath1221.90049MaRDI QIDQ639194

Ịnci Sarıçiçek, Cenk Çelik

Publication date: 18 September 2011

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2011.02.035

zbMATH Keywords

simulated annealing; tabu search; parallel machine scheduling; total tardiness; job splitting

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research

Uses Software

• LINDO
• LINGO
• Tabu search