Pages that link to "Item:Q967805"
From MaRDI portal
The following pages link to Optimal methods for batch processing problem with makespan and maximum lateness objectives (Q967805):
Displaying 12 items.
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine (Q892842) (← links)
- Bi-objective scheduling on a restricted batching machine (Q1782176) (← links)
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives (Q1788999) (← links)
- A constraint programming approach for a batch processing problem with non-identical job sizes (Q1926887) (← links)
- Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan (Q2172079) (← links)
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives (Q2176838) (← links)
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
- Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines (Q2289001) (← links)
- Unbounded parallel-batch scheduling with drop-line tasks (Q2304116) (← links)
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work (Q2359798) (← links)
- Unbounded parallel-batching scheduling with two competitive agents (Q2434303) (← links)
- Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times (Q5865923) (← links)
