The following pages link to (Q3989986):
Displayed 15 items.
- A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan (Q342431) (← links)
- Heuristics for capacity planning problems with congestion (Q1000984) (← links)
- Preemptive scheduling with release dates, delivery times and sequence independent setup times (Q1331546) (← links)
- Scheduling of multi-spindle CNC gantry mills (Q1347599) (← links)
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops (Q1607977) (← links)
- A sequencing problem with family setup times (Q1917311) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Single-machine scheduling problems with past-sequence-dependent setup times (Q2467251) (← links)
- A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times (Q2572851) (← links)
- Semiconductor final-test scheduling under setup operator constraints (Q2669721) (← links)
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times (Q4394265) (← links)
- Scheduling of wafer test processes in semiconductor manufacturing (Q4474714) (← links)
- Minimizing makespan on parallel machines with release time and machine eligibility restrictions (Q4823576) (← links)
- Single-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis (Q4909046) (← links)
- In-house development of scheduling decision support systems: case study for scheduling semiconductor device test operations (Q5428722) (← links)