Pages that link to "Item:Q4717156"
From MaRDI portal
The following pages link to Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach (Q4717156):
Displaying 12 items.
- A simulated annealing algorithm for single machine scheduling problems with family setups (Q1013384) (← links)
- A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour (Q1268835) (← links)
- Single facility scheduling with major and minor setups (Q1373896) (← links)
- Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time (Q1374439) (← links)
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times (Q1976518) (← links)
- A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times (Q2432854) (← links)
- Multi-machine scheduling problem with setup times (Q2847181) (← links)
- (Q3641992) (← links)
- A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage (Q4973250) (← links)
- Multiple machine JIT scheduling: a tabu search approach (Q5428715) (← links)
- Tabu search for a class of single-machine scheduling problems (Q5945325) (← links)
- Minimizing the total waiting time of intermediate products in a manufacturing process (Q6088134) (← links)