Pages that link to "Item:Q4834060"

The following pages link to The Total Tardiness Problem: Review and Extensions (Q4834060):

Displaying 50 items.

• An assignment-based lower bound for a class of two-machine flow shop problems (Q336351) (← links)
• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
• Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times (Q337017) (← links)
• A theoretical development for the total tardiness problem and its application in branch and bound algorithms (Q339575) (← links)
• Acquisition planning and scheduling of computing resources (Q342569) (← links)
• New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486) (← links)
• Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem (Q732689) (← links)
• A tabu search algorithm for the single machine total weighted tardiness problem (Q853020) (← links)
• Scheduling on parallel identical machines to minimize total tardiness (Q856206) (← links)
• A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems (Q858325) (← links)
• Scheduling unrelated parallel machines with sequence-dependent setups (Q883307) (← links)
• Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach (Q883312) (← links)
• Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics (Q941559) (← links)
• Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm (Q958545) (← links)
• Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← links)
• The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
• Minimizing total tardiness on a two-machine re-entrant flowshop (Q1042154) (← links)
• On minimizing the sum of \(k\) tardinesses (Q1178234) (← links)
• A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem (Q1265840) (← links)
• Single-machine scheduling with time windows and earliness/tardiness penalties (Q1278201) (← links)
• A note on the equivalence of two heuristics to minimize total tardiness (Q1278526) (← links)
• The job shop tardiness problem: A corrected model (Q1342655) (← links)
• Effects of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties (Q1368414) (← links)
• Scheduling parallel machines to minimize total weighted and unweighted tardiness (Q1370670) (← links)
• `Aversion dynamics' scheduling when the system changes (Q1567297) (← links)
• Solution of the single machine total tardiness problem (Q1592283) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• A comprehensive review of flowshop group scheduling literature (Q1651625) (← links)
• Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems (Q1694923) (← links)
• Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints (Q1762106) (← links)
• A tabu search algorithm for parallel machine total tardiness problem (Q1765548) (← links)
• On the single machine total tardiness problem (Q1771373) (← links)
• Optimal and heuristic solutions for a scheduling problem arising in a foundry (Q1772868) (← links)
• A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness (Q1793450) (← links)
• Match-up scheduling under a machine breakdown (Q1806884) (← links)
• New heuristics for total tardiness minimization in a flexible flowshop (Q1947616) (← links)
• Scheduling with divisible jobs and subcontracting option (Q2147141) (← links)
• Multi-objective evolutionary algorithm for solving energy-aware fuzzy job shop problems (Q2156606) (← links)
• A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times (Q2217032) (← links)
• Flow shops with reentry: reversibility properties and makespan optimal schedules (Q2282537) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• A metric for total tardiness minimization (Q2362385) (← links)
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach (Q2370333) (← links)
• Parallel machine selection and job scheduling to minimize machine cost and job tardiness (Q2387248) (← links)
• Note on minimizing total tardiness in a two-machine flowshop (Q2387308) (← links)
• Minimizing due date related measures for a single machine scheduling problem with outsourcing allowed (Q2426523) (← links)
• Algorithms for single machine total tardiness scheduling with sequence dependent setups (Q2433437) (← links)
• The single-machine total tardiness problem with unequal release times and a linear deterioration (Q2511712) (← links)
• Pricing and scheduling decisions with leadtime flexibility (Q2576254) (← links)
• Quantifying the impact of sharing resources in a collaborative warehouse (Q2672072) (← links)