Scheduling with parallel processors and linear delay costs

DOI10.1002/nav.3800200417zbMath0273.90030OpenAlexW2038994007MaRDI QIDQ5181071

Kenneth R. Baker, Alan G. Merten

Publication date: 1973

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800200417

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (12)

Minimizing the number of tardy jobs for \(m\) parallel machines ⋮ Matching based very large-scale neighborhoods for parallel machine scheduling ⋮ GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times ⋮ An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime ⋮ A state-of-the-art review of parallel-machine scheduling research ⋮ An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines ⋮ Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms ⋮ Heuristic methods for the identical parallel machine flowtime problem with set-up times ⋮ On the minimization of total weighted flow time with identical and uniform parallel machines ⋮ Heuristic methods and applications: A categorized survey ⋮ A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems ⋮ Scheduling identical parallel machines to minimize total weighted completion time

This page was built for publication: Scheduling with parallel processors and linear delay costs