Pages that link to "Item:Q1926887"
From MaRDI portal
The following pages link to A constraint programming approach for a batch processing problem with non-identical job sizes (Q1926887):
Displayed 12 items.
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services (Q297101) (← links)
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system (Q1652207) (← links)
- Integrated scheduling of production and distribution for manufacturers with parallel batching facilities (Q1800447) (← 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)
- Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine (Q2182772) (← links)
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time (Q2184132) (← links)
- The piggyback transportation problem: transporting drones launched from a flying warehouse (Q2242297) (← links)
- Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace (Q2656512) (← 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)
- Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine (Q2669805) (← links)