On-line scheduling a batch processing system to minimize total weighted job completion time
From MaRDI portal
(Redirected from Publication:1768601)
Recommendations
- scientific article; zbMATH DE number 2081006
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time
- On-line algorithms for minimizing makespan on batch processing machines
- Minimizing mean completion time in a batch processing system
Cited in
(12)- Online algorithms to schedule a proportionate flexible flow shop of batching machines
- A PTAS for semiconductor burn-in scheduling
- Minimizing total completion time on a batching machine with job processing time compatibilities
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
- Scheduling an unbounded batching machine with job processing time compatibilities
- MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
- Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
- scientific article; zbMATH DE number 2081006 (Why is no real title available?)
- Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility
- Single machine batch scheduling with release times
- Online over time scheduling on parallel-batch machines: a survey
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
This page was built for publication: On-line scheduling a batch processing system to minimize total weighted job completion time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1768601)
