Pages that link to "Item:Q2464401"
From MaRDI portal
The following pages link to The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard (Q2464401):
Displaying 14 items.
- A coordination mechanism for a scheduling game with parallel-batching machines (Q511705) (← links)
- The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard (Q856324) (← links)
- Single machine batch scheduling problem with family setup times and release dates to minimize makespan (Q880565) (← links)
- An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines (Q957356) (← links)
- A simulated annealing algorithm for single machine scheduling problems with family setups (Q1013384) (← links)
- Integrated production and multiple trips vehicle routing with time windows and uncertain travel times (Q1634047) (← links)
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness (Q1683059) (← links)
- A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups (Q1761169) (← links)
- Solving the serial batching problem in job shop manufacturing systems (Q1926815) (← 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)
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (Q2434270) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- Machine scheduling with job class setup and delivery considerations (Q2655964) (← links)
