Dominance rules in combinatorial optimization problems
From MaRDI portal
Publication:421551
DOI10.1016/j.ejor.2010.11.008zbMath1237.90199OpenAlexW1970600856MaRDI QIDQ421551
Antoine Jouglet, Jacques Carlier
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.11.008
Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (14)
A characterization of optimal multiprocessor schedules and new dominance rules ⋮ Order acceptance and due-date quotation in low machine rates ⋮ An improved exact algorithm for least-squares unidimensional scaling ⋮ Robust routing in deterministic delay-tolerant networks ⋮ Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics ⋮ Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness ⋮ An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective ⋮ Dominance inequalities for scheduling around an unrestrictive common due date ⋮ Modeling elements and solving techniques for the data dissemination problem ⋮ Minimizing the weighted sum of squared tardiness on a single machine ⋮ Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty ⋮ A data structure for efficiently managing a set of energy functions ⋮ On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming ⋮ Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling with release dates on a single machine to minimize total weighted completion time
- Efficient heuristics to minimize total flow time with release dates
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
- Adjustment of heads and tails for the job-shop problem
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Dominance-based heuristics for one-machine total cost scheduling problems
- Optimal two- and three-stage production schedules with setup times included
- Outline of an algorithm for integer solutions to linear programs
- An Automatic Method of Solving Discrete Programming Problems
- A Dynamic Programming Approach to Sequencing Problems
- Symmetry Definitions for Constraint Satisfaction Problems
- General Symmetry Breaking Constraints
- Principles of Sequencing and Scheduling
- Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
- The Power of Dominance Relations in Branch-and-Bound Algorithms
- Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
- Backtrack Programming
- Branch-and-Bound Methods: A Survey
- Discrete Programming by the Filter Method
- An Algorithm for the Traveling Salesman Problem
- Discrete Optimization Via Marginal Analysis
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Letter to the Editor—A Note on the Branch-and-Bound Principle
- Branch-and-Bound Methods: General Formulation and Properties
- Algorithms for Solving Production-Scheduling Problems
- The theory of dynamic programming
- Handbook of metaheuristics
This page was built for publication: Dominance rules in combinatorial optimization problems
