Pages that link to "Item:Q1762063"
From MaRDI portal
The following pages link to A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals (Q1762063):
Displaying 6 items.
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time (Q2184132) (← links)
- Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines (Q2297575) (← links)
- Single batch machine scheduling with dual setup times for autoclave molding manufacturing (Q2668803) (← links)
- Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling (Q5087720) (← links)
- A makespan minimization problem for versatile developers in the game industry (Q6186551) (← links)