Heuristics for minimizing mean tardiness form parallel machines
From MaRDI portal
Publication:5202825
Recommendations
- Scheduling parallel machines to minimize total weighted and unweighted tardiness
- Minimizing the number of tardy jobs for \(m\) parallel machines
- Scheduling on parallel identical machines to minimize total tardiness
- Job Tardiness in Unequal Parallel Processor Systems
- Minimising earliness and tardiness on parallel machines with sequence-dependent setups
Cited in
(13)- Acquisition planning and scheduling of computing resources
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization
- Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
- A tabu search algorithm for parallel machine total tardiness problem
- Minimizing the number of tardy jobs for \(m\) parallel machines
- Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
- Scheduling on parallel identical machines to minimize total tardiness
- A note on the equivalence of two heuristics to minimize total tardiness
- Scheduling unrelated parallel machines with sequence-dependent setups
- Scheduling parallel machines to minimize total weighted and unweighted tardiness
- Minimizing the average tardiness: the case of outsource machines
- Parallel machine scheduling considering a job-splitting property
- A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property
This page was built for publication: Heuristics for minimizing mean tardiness form parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202825)