The following pages link to (Q3070927):
Displayed 8 items.
- Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan (Q300969) (← links)
- A DP algorithm for minimizing makespan and total completion time on a series-batching machine (Q987835) (← links)
- Bounded serial-batching scheduling for minimizing maximum lateness and makespan (Q1751110) (← links)
- Unbounded serial-batching scheduling on hierarchical optimization (Q2059199) (← links)
- Serial-batching scheduling with two agents to minimize makespan and maximum cost (Q2215193) (← links)
- Improved algorithms for two-agent scheduling on an unbounded serial-batching machine (Q2234745) (← links)
- Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost (Q2333219) (← links)
- Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives (Q6186161) (← links)