Pages that link to "Item:Q421551"
From MaRDI portal
The following pages link to Dominance rules in combinatorial optimization problems (Q421551):
Displayed 14 items.
- Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics (Q342173) (← links)
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective (Q439458) (← links)
- A characterization of optimal multiprocessor schedules and new dominance rules (Q830925) (← links)
- Order acceptance and due-date quotation in low machine rates (Q1630128) (← links)
- Robust routing in deterministic delay-tolerant networks (Q1651586) (← links)
- Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness (Q1666548) (← links)
- Modeling elements and solving techniques for the data dissemination problem (Q1752253) (← links)
- Minimizing the weighted sum of squared tardiness on a single machine (Q1762060) (← links)
- A data structure for efficiently managing a set of energy functions (Q2084624) (← links)
- Dominance inequalities for scheduling around an unrestrictive common due date (Q2242293) (← links)
- Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty (Q2286919) (← links)
- On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming (Q2337226) (← links)
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains (Q2355078) (← links)
- An improved exact algorithm for least-squares unidimensional scaling (Q2375707) (← links)