Pages that link to "Item:Q3019221"
From MaRDI portal
The following pages link to Solving single batch-processing machine problems using an iterated heuristic (Q3019221):
Displaying 9 items.
- Split-merge: using exponential neighborhood search for scheduling a batching machine (Q342048) (← links)
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system (Q1652207) (← links)
- Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs (Q2027084) (← links)
- Column generation for minimizing total completion time in a parallel-batching environment (Q2066680) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- When serial batch scheduling involves parallel batching decisions: a branch and price scheme (Q2669619) (← links)
- Just-in-time single-batch-processing machine scheduling (Q2669787) (← links)
- Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm (Q2795178) (← links)
- Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling (Q5087720) (← links)
