Pages that link to "Item:Q1197646"
From MaRDI portal
The following pages link to Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem (Q1197646):
Displaying 12 items.
- An investigation on a two-agent single-machine scheduling problem with unequal release dates (Q339650) (← links)
- Dominance rules in combinatorial optimization problems (Q421551) (← links)
- A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects (Q497951) (← links)
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates (Q596267) (← links)
- Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates (Q632665) (← links)
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem (Q842556) (← links)
- Scheduling a single machine to minimize a regular objective function under setup constraints (Q1779690) (← links)
- New heuristics for total tardiness minimization in a flexible flowshop (Q1947616) (← links)
- Dominance-based heuristics for one-machine total cost scheduling problems (Q2384840) (← links)
- Minimizing total tardiness on a single machine with unequal release dates (Q2462144) (← links)
- Permutation flow shop scheduling with earliness and tardiness penalties (Q3055278) (← links)
- A new dominance rule to minimize total weighted tardiness with unequal release dates. (Q5952443) (← links)
