Pages that link to "Item:Q1751110"
From MaRDI portal
The following pages link to Bounded serial-batching scheduling for minimizing maximum lateness and makespan (Q1751110):
Displaying 15 items.
- Optimal methods for batch processing problem with makespan and maximum lateness objectives (Q967805) (← links)
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan (Q995579) (← links)
- Bi-objective scheduling on a restricted batching machine (Q1782176) (← links)
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times (Q1876151) (← links)
- Unbounded serial-batching scheduling on hierarchical optimization (Q2059199) (← links)
- Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost (Q2081468) (← links)
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems (Q2093186) (← links)
- Mixed batch scheduling on identical machines (Q2197328) (← links)
- Improved algorithms for two-agent scheduling on an unbounded serial-batching machine (Q2234745) (← links)
- Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines (Q2289001) (← links)
- Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost (Q2333219) (← links)
- (Q5383745) (← links)
- (Q5490470) (← links)
- Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives (Q6186161) (← links)
- Metaheuristics for solving a flexible flow-shop scheduling problem with s-batching machines (Q6609697) (← links)
