Pages that link to "Item:Q856206"

The following pages link to Scheduling on parallel identical machines to minimize total tardiness (Q856206):

Displaying 50 items.

• Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness (Q319136) (← links)
• Practical solutions for a dock assignment problem with trailer transportation (Q319870) (← links)
• Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints (Q320637) (← links)
• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
• Acquisition planning and scheduling of computing resources (Q342569) (← links)
• Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility (Q490371) (← links)
• Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties (Q534918) (← links)
• A united search particle swarm optimization algorithm for multiobjective scheduling problem (Q611608) (← 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)
• Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness (Q639194) (← links)
• A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems (Q858325) (← links)
• Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs (Q858442) (← links)
• Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints (Q868990) (← links)
• Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system (Q954048) (← links)
• Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness (Q1011327) (← links)
• Heuristic algorithms for a complex parallel machine scheduling problem (Q1022398) (← links)
• Minimizing the number of tardy jobs for \(m\) parallel machines (Q1127174) (← links)
• List scheduling algorithms to minimize the makespan on identical parallel machines (Q1348708) (← links)
• Scheduling parallel machines to minimize total weighted and unweighted tardiness (Q1370670) (← links)
• Scheduling unrelated parallel machines to minimize total weighted tardiness. (Q1413838) (← links)
• Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays (Q1631999) (← links)
• Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
• Scheduling identical parallel machines with tooling constraints (Q1752870) (← links)
• Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints (Q1762106) (← links)
• Two branch-and-bound algorithms for the robust parallel machine scheduling problem (Q1762154) (← links)
• Sequential scheduling on identical machines (Q1785424) (← links)
• A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs (Q1891237) (← links)
• Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs (Q1960313) (← 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)
• Scheduling with uncertain processing times in mixed-criticality systems (Q2315625) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan (Q2361139) (← links)
• Parallel machine selection and job scheduling to minimize machine cost and job tardiness (Q2387248) (← links)
• Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm (Q2403558) (← links)
• A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property (Q2456645) (← links)
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802) (← links)
• Interval scheduling on identical machines (Q2564884) (← links)
• Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs (Q2566704) (← links)
• On the mass COVID-19 vaccination scheduling problem (Q2669767) (← links)
• Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date (Q2676340) (← links)
• Schedule grouped jobs on parallel machines with single mold constraint (Q2725354) (← links)
• A Multiobjective Optimization Approach to Solve a Parallel Machines Scheduling Problem (Q3083901) (← links)
• Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions (Q3166272) (← links)
• Heuristics for minimizing mean tardiness form parallel machines (Q5202825) (← links)
• Approximating Real-Time Scheduling on Identical Machines (Q5405072) (← links)
• Minimizing total tardiness in an unrelated parallel-machine scheduling problem (Q5428943) (← links)
• Dynamic scheduling of patients in emergency departments (Q6113312) (← links)