Equal processing time bicriteria scheduling on parallel machines
From MaRDI portal
(Redirected from Publication:1888166)
Recommendations
- Bicriterion scheduling with equal processing times on a batch processing machine
- Bicriterion scheduling of identical processing time jobs by uniform processors
- Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines
- Bicriteria scheduling of equal length jobs on uniform parallel machines
- Scheduling jobs with equal processing times and time windows on identical parallel machines
Cited in
(12)- Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines
- Bicriteria scheduling of equal length jobs on uniform parallel machines
- Bicriteria multi-machine scheduling with equal processing times subject to release dates
- Scheduling jobs with equal processing times and time windows on identical parallel machines
- Pareto-scheduling of two competing agents with their own equal processing times
- Bicriteria scheduling for contiguous and non contiguous parallel tasks
- scientific article; zbMATH DE number 4162635 (Why is no real title available?)
- On a parallel machine scheduling problem with equal processing times
- Bi-criteria scheduling on a single parallel-batch machine
- Bicriterion scheduling with equal processing times on a batch processing machine
- Faster algorithms for bicriteria scheduling of identical jobs on uniform machines
- Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
This page was built for publication: Equal processing time bicriteria scheduling on parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1888166)
