Scheduling with Deadlines and Loss Functions on k Parallel Machines

DOI10.1287/mnsc.11.3.460zbMath0128.39502OpenAlexW2149741800MaRDI QIDQ5336842

J. G. Root

Publication date: 1965

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.11.3.460

zbMATH Keywords

operations research

Related Items (13)

Scheduling on parallel identical machines to minimize total tardiness ⋮ Scheduling parallel machines to minimize total weighted and unweighted tardiness ⋮ Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm ⋮ Minimizing the number of tardy jobs for \(m\) parallel machines ⋮ Minimizing the average tardiness: the case of outsource machines ⋮ Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines ⋮ A state-of-the-art review of parallel-machine scheduling research ⋮ Notes on inverse bin-packing problems ⋮ A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property ⋮ Job Tardiness in Unequal Parallel Processor Systems ⋮ A tabu search algorithm for parallel machine total tardiness problem ⋮ Parallel machine scheduling considering a job-splitting property ⋮ Production scheduling of independent jobs on parallel identical processors

This page was built for publication: Scheduling with Deadlines and Loss Functions on k Parallel Machines