Pages that link to "Item:Q5202825"
From MaRDI portal
The following pages link to Heuristics for minimizing mean tardiness form parallel machines (Q5202825):
Displaying 13 items.
- Acquisition planning and scheduling of computing resources (Q342569) (← links)
- Scheduling on parallel identical machines to minimize total tardiness (Q856206) (← links)
- Scheduling unrelated parallel machines with sequence-dependent setups (Q883307) (← links)
- Minimizing the number of tardy jobs for \(m\) parallel machines (Q1127174) (← links)
- A note on the equivalence of two heuristics to minimize total tardiness (Q1278526) (← links)
- Scheduling parallel machines to minimize total weighted and unweighted tardiness (Q1370670) (← links)
- A tabu search algorithm for parallel machine total tardiness problem (Q1765548) (← links)
- A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property (Q2456645) (← links)
- Minimizing the average tardiness: the case of outsource machines (Q3498921) (← links)
- Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem (Q4346870) (← links)
- Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs (Q4367301) (← links)
- Parallel machine scheduling considering a job-splitting property (Q4671338) (← links)
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization (Q6114940) (← links)
