Pages that link to "Item:Q3082645"
From MaRDI portal
The following pages link to Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times (Q3082645):
Displaying 11 items.
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944) (← links)
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times (Q707000) (← links)
- Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine (Q829170) (← links)
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time (Q1656199) (← links)
- The medical laboratory scheduling for weighted flow-time (Q1740398) (← links)
- Online algorithms to schedule a proportionate flexible flow shop of batching machines (Q2093188) (← links)
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063) (← links)
- Online Linear Optimization for Job Scheduling Under Precedence Constraints (Q2835641) (← links)
- Minimising makespan for two batch-processing machines with non-identical job sizes in job shop (Q2935125) (← links)
- Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines (Q5009625) (← links)
- Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs (Q5265640) (← links)