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

DOI10.1016/S0377-2217(00)00319-2MaRDI QIDQ5952443zbMATH OpenFDO

Authors M. Selim Aktürk, Deniz Ozdemir

Publication date 2001

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

Full work available at URL https://doi.org/10.1016/S0377-2217(00)00319-2

zbMATH Keywords

Dominance ruleHeuristicsSchedulingSingle machineWeighted tardiness

Mathematics Subject Classification ID

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

Recommendations

• A new lower bounding scheme for the total weighted tardiness problem.
• Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates
• Dominance and Decomposition Heuristics for Single Machine Scheduling
• Dominance-based heuristics for one-machine total cost scheduling problems
• Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates

Cites work

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

Cited in

(21)

• The one machine scheduling problem: insertion of a job under the real-time constraint
• A new lower bounding scheme for the total weighted tardiness problem.
• The single-machine total weighted tardiness scheduling problem with position-based learning effects
• 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
• Metaheuristics for a scheduling problem with rejection and tardiness penalties
• Iterated greedy algorithms for a complex parallel machine scheduling problem
• Dominance-based heuristics for one-machine total cost scheduling problems
• Minimizing total tardiness on a single machine with unequal release dates
• Exact algorithms for single-machine scheduling with time windows and precedence constraints
• ON A DOMINANCE TEST FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH RELEASE DATES TO MINIMIZE TOTAL FLOW TIME
• 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
• A heuristic algorithm to minimize total weighted tardiness on a single machine with release times
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
• 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
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952443)