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 26 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)
- Fast LP models and algorithms for identical jobs on uniform parallel machines (Q727360) (← 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)
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes (Q1652033) (← links)
- A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach (Q1699353) (← links)
- Exact methods for order acceptance and scheduling on unrelated parallel machines (Q1725610) (← 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)
- Order assignment and scheduling under processing and distribution time uncertainty (Q2083940) (← links)
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (Q2108098) (← links)
- On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
- An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics (Q2273664) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- Dynamic dispatching and preventive maintenance for parallel machines with dispatching-dependent deterioration (Q2333138) (← 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)
- Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date (Q2676340) (← links)
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization (Q6114940) (← links)
- An exact branch-and-bound algorithm for \textit{seru} scheduling problem with sequence-dependent setup time and release date (Q6149341) (← links)