A new dominance rule to minimize total weighted tardiness with unequal release dates.

DOI10.1016/S0377-2217(00)00319-2zbMath1051.90013MaRDI QIDQ5952443

M. Selim Akturk, Deniz Ozdemir

Publication date: 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

HeuristicsSchedulingSingle machineDominance ruleWeighted tardiness

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)

Related Items (19)

RETRACTED ARTICLE: Approach towards problem solving on single machine scheduling with unequal release dates and learning effect ⋮ Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates ⋮ Exact algorithms for single-machine scheduling with time windows and precedence constraints ⋮ Dominance-based heuristics for one-machine total cost scheduling problems ⋮ Scheduling parallel-machine batch operations to maximize on-time delivery performance ⋮ Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics ⋮ Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems ⋮ Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates ⋮ Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs ⋮ Minimizing total tardiness on a single machine with unequal release dates ⋮ The single-machine total weighted tardiness scheduling problem with position-based learning effects ⋮ A heuristic algorithm to minimize total weighted tardiness on a single machine with release times ⋮ Metaheuristics for a scheduling problem with rejection and tardiness penalties ⋮ On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation ⋮ Scheduling a single machine to minimize a regular objective function under setup constraints ⋮ Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times ⋮ An exact approach to early/tardy scheduling with release dates ⋮ The one machine scheduling problem: insertion of a job under the real-time constraint ⋮ Iterated greedy algorithms for a complex parallel machine scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tactically delayed versus non-delay scheduling: An experimental investigation
• An algorithm for single machine sequencing with release dates to minimize total weighted completion time
• Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
• A new lower bounding scheme for the total weighted tardiness problem.
• Greedy randomized adaptive search procedures
• Scheduling of a single machine to minimize total weighted completion time subject to release dates
• Technical Note—A Note on the Weighted Tardiness Problem
• Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
• Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
• A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Minimizing Total Costs in One-Machine Scheduling
• Weighted Tardiness Single Machine Scheduling with Proportional Weights
• Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
• Problem and Heuristic Space Search Strategies for Job Shop Scheduling
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness

This page was built for publication: A new dominance rule to minimize total weighted tardiness with unequal release dates.