Pages that link to "Item:Q987835"
From MaRDI portal
The following pages link to A DP algorithm for minimizing makespan and total completion time on a series-batching machine (Q987835):
Displaying 6 items.
- Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan (Q300969) (← links)
- Bounded serial-batching scheduling for minimizing maximum lateness and makespan (Q1751110) (← links)
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
- Improved algorithms for two-agent scheduling on an unbounded serial-batching machine (Q2234745) (← links)
- A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach (Q2668761) (← links)
- BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN (Q2931723) (← links)
