The following pages link to (Q4017560):
Displayed 26 items.
- A hybrid heuristic approach for single machine scheduling with release times (Q336949) (← links)
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time (Q339589) (← links)
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
- Single machine batch scheduling with release times and delivery costs (Q398839) (← links)
- A single-machine scheduling with a truncated linear deterioration and ready times (Q497952) (← links)
- Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times (Q622157) (← links)
- Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates (Q632665) (← links)
- Efficient heuristics to minimize total flow time with release dates (Q1195875) (← links)
- Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. (Q1413906) (← links)
- Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates (Q1761994) (← links)
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals (Q1762063) (← links)
- Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates (Q1762109) (← links)
- Scheduling a single machine to minimize a regular objective function under setup constraints (Q1779690) (← links)
- Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem (Q1781577) (← links)
- An iterative heuristic for the single machine dynamic total completion time scheduling problem (Q1919773) (← links)
- \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies (Q2356207) (← links)
- Dominance-based heuristics for one-machine total cost scheduling problems (Q2384840) (← links)
- Single-machine scheduling with no idle time and release dates to~minimize a regular criterion (Q2434281) (← links)
- Algorithms for single-machine scheduling problem with deterioration depending on a novel model (Q2628177) (← links)
- Two very large-scale neighborhoods for single machine scheduling (Q2642308) (← links)
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions (Q3166272) (← links)
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (Q5187929) (← links)
- A new dominance rule to minimize total weighted tardiness with unequal release dates. (Q5952443) (← links)
- Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates (Q6066663) (← links)