Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-018-0309-3
Abstract: We study the online scheduling problem on m identical parallel machines to minimize makespan, i.e., the maximum completion time of the jobs, where m is given in advance and the jobs arrive online over time.… read more here.
Keywords: parallel machines; chain precedence; online scheduling; precedence constraints ... See more keywords