Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times

DOI10.1016/S1004-4132(08)60160-7zbMath1219.90065OpenAlexW1567280688MaRDI QIDQ3087703

Kai Li, Shan-Lin Yang

Publication date: 16 August 2011

Published in: Journal of Systems Engineering and Electronics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1004-4132(08)60160-7

zbMATH Keywords

algorithmschedulingrelaxationparallel machinereviewtotal weighted completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

This page was built for publication: Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times