Pages that link to "Item:Q300969"
From MaRDI portal
The following pages link to Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan (Q300969):
Displaying 17 items.
- A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size (Q398896) (← links)
- A DP algorithm for minimizing makespan and total completion time on a series-batching machine (Q987835) (← links)
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan (Q995579) (← links)
- Scheduling a batching machine (Q1268850) (← links)
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)
- Bounded serial-batching scheduling for minimizing maximum lateness and makespan (Q1751110) (← links)
- Bi-objective scheduling on a restricted batching machine (Q1782176) (← links)
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time (Q1924612) (← links)
- Unbounded serial-batching scheduling on hierarchical optimization (Q2059199) (← 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)
- An improved algorithm for a bicriteria batching scheduling problem (Q2845028) (← links)
- A bicriteria flow-shop scheduling problem with two serial batching machines (Q2861549) (← links)
- Two problems about single machine parallel batching with batching costs (Q2916672) (← links)
- (Q3668284) (← links)
- Bicriteria Scheduling on a Single Batching Machine with Transportation and Deterioration to Minimize Total Completion Time and Production Costs (Q5348802) (← links)
- Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives (Q6186161) (← links)
