Scheduling Equal-Length Jobs with Delivery times on Identical Processors
From MaRDI portal
Publication:4551464
Recommendations
- A better algorithm for sequencing with release and delivery times on identical machines
- A fast algorithm for multi-machine scheduling problems with jobs of equal processing times
- Scheduling equal-length jobs on identical parallel machines
- Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time
- Scheduling jobs with equal processing times and time windows on identical parallel machines
Cites work
- A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
- Sequencing with due-dates and early start times to minimize maximum tardiness
- The one-machine sequencing problem
Cited in
(7)- Time-of-use scheduling problem with equal-length jobs
- scientific article; zbMATH DE number 1530325 (Why is no real title available?)
- A fast algorithm for multi-machine scheduling problems with jobs of equal processing times
- Variants of Multi-resource Scheduling Problems with Equal Processing Times
- A better algorithm for sequencing with release and delivery times on identical machines
- Scheduling jobs with equal processing times and a single server on parallel identical machines
- Scheduling jobs with sizes and delivery times on identical parallel batch machines
This page was built for publication: Scheduling Equal-Length Jobs with Delivery times on Identical Processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4551464)