Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors
DOI10.1287/MNSC.25.12.1208zbMATH Open0465.90046OpenAlexW2113417797MaRDI QIDQ3917876FDOQ3917876
Publication date: 1979
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.25.12.1208
parallel processorsheuristic methodsindependent taskscomputational experiencerandom test problemsnonparametric statistical analysis
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)
Cited In (12)
- A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property
- Scheduling parallel processors to minimize setup time
- A state-of-the-art review of parallel-machine scheduling research
- Heuristic methods and applications: A categorized survey
- Parallel machine scheduling considering a job-splitting property
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- Scheduling on parallel identical machines to minimize total tardiness
- Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines
- Minimizing the average tardiness: the case of outsource machines
- A tabu search algorithm for parallel machine total tardiness problem
- Production scheduling of independent jobs on parallel identical processors
- Job Tardiness in Unequal Parallel Processor Systems
This page was built for publication: Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3917876)
