Pages that link to "Item:Q1266534"
From MaRDI portal
The following pages link to Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs (Q1266534):
Displaying 8 items.
- An iterative approach for the serial batching problem with parallel machines and job families (Q363588) (← links)
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups (Q1296704) (← links)
- Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates (Q1762109) (← links)
- Scheduling with batching: A review (Q1969826) (← links)
- Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs (Q2464440) (← links)
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine (Q4432721) (← links)
- A hybrid heuristic approach to minimize number of tardy jobs in group technology systems (Q6066616) (← links)
