Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors
From MaRDI portal
Publication:3917876
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)