Pages that link to "Item:Q1413838"
From MaRDI portal
The following pages link to Scheduling unrelated parallel machines to minimize total weighted tardiness. (Q1413838):
Displayed 13 items.
- Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness (Q319136) (← links)
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
- Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates (Q632665) (← links)
- Scheduling on parallel identical machines to minimize total tardiness (Q856206) (← links)
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops (Q857354) (← links)
- Scheduling unrelated parallel machines with sequence-dependent setups (Q883307) (← links)
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm (Q958545) (← links)
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) (← links)
- Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints (Q1762106) (← links)
- Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning (Q1762118) (← links)
- Parallel machine selection and job scheduling to minimize machine cost and job tardiness (Q2387248) (← links)
- A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property (Q2456645) (← links)