Pages that link to "Item:Q511691"
From MaRDI portal
The following pages link to Handling precedence constraints in scheduling problems by the sequence pair representation (Q511691):
Displaying 12 items.
- On dual based lower bounds for the sequential ordering problem with precedences and due dates (Q1417775) (← links)
- Scheduling under the network of temporo-spatial proximity relationships (Q1652320) (← links)
- Normal-form preemption sequences for an open problem in scheduling theory (Q1702732) (← links)
- Solving an integrated cell formation and group layout problem using a simulated annealing enhanced by linear programming (Q2156474) (← links)
- Sequencing with ordered criteria, precedence and group technology constraints (Q2731287) (← links)
- Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width (Q3133204) (← links)
- (Q3217918) (← links)
- (Q3396634) (← links)
- Quasi-PTAS for scheduling with precedences using LP hierarchies (Q5002735) (← links)
- Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm (Q5059243) (← links)
- (Q5456411) (← links)
- Computational Science – ICCS 2005 (Q5709627) (← links)