Pages that link to "Item:Q342048"

The following pages link to Split-merge: using exponential neighborhood search for scheduling a batching machine (Q342048):

Displaying 8 items.

• A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour (Q1268835) (← links)
• Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system (Q1652207) (← links)
• Bi-objective scheduling on a restricted batching machine (Q1782176) (← links)
• An exponential neighborhood for a one-machine batching problem (Q1808727) (← links)
• Column generation for minimizing total completion time in a parallel-batching environment (Q2066680) (← links)
• Logic-based Benders decomposition for scheduling a batching machine (Q2333133) (← 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)