Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines

DOI10.1016/J.ENDM.2010.05.069zbMath1237.90103OpenAlexW2054895354MaRDI QIDQ2883611

Imed Kacem, Taïcir Loukil, Bassem Jarboui, Makram Zaidi

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.069

zbMATH Keywords

schedulingtotal weighted completion timeparallel-machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (2)

An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem ⋮ GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times

Cites Work

• A state-of-the-art review of parallel-machine scheduling research
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
• Variable neighborhood search
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• A variable neighborhood search for graph coloring.
• On the minimization of total weighted flow time with identical and uniform parallel machines
• Handbook of metaheuristics

This page was built for publication: Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines