Pages that link to "Item:Q1919357"
From MaRDI portal
The following pages link to A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times (Q1919357):
Displayed 7 items.
- Scheduling and constraint propagation (Q697570) (← links)
- Tabu search algorithms for job-shop problems with a single transport robot (Q707135) (← links)
- Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis (Q817121) (← links)
- An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem (Q875429) (← links)
- A branch and bound method for the job-shop problem with sequence-dependent setup times (Q940884) (← links)
- Constraint-directed techniques for scheduling alternative activities (Q1583239) (← links)
- Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches (Q2485332) (← links)