Pages that link to "Item:Q856324"
From MaRDI portal
The following pages link to The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard (Q856324):
Displaying 5 items.
- Hardware design of a new genetic based disk scheduling method (Q617747) (← links)
- A simulated annealing algorithm for single machine scheduling problems with family setups (Q1013384) (← links)
- Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines (Q2317137) (← links)
- Unary NP-hardness of minimizing the number of tardy jobs with deadlines (Q2398650) (← links)
- Single batch machine scheduling with dual setup times for autoclave molding manufacturing (Q2668803) (← links)
