Pages that link to "Item:Q2861568"
From MaRDI portal
The following pages link to Minimizing total completion time on a batching machine with job processing time compatibilities (Q2861568):
Displaying 4 items.
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints (Q1752766) (← links)
- Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine (Q2669805) (← links)
- Minimizing the Range of Order Completion Times with Multiple Job Classes (Q4273304) (← links)
- A hybrid neural network approach to minimize total completion time on a single batch processing machine (Q6092620) (← links)