Scheduling Equal-Length Jobs with Delivery times on Identical Processors
From MaRDI portal
Publication:4551464
DOI10.1080/00207160211288zbMATH Open1024.68008OpenAlexW2169713267MaRDI QIDQ4551464FDOQ4551464
Authors: Nodari Vakhania
Publication date: 28 August 2002
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160211288
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
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
- A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
- The one-machine sequencing problem
- Sequencing with due-dates and early start times to minimize maximum tardiness
- 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
Cited In (7)
- Time-of-use scheduling problem with equal-length jobs
- Scheduling jobs with equal processing times and a single server on parallel identical machines
- Title not available (Why is that?)
- 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 sizes and delivery times on identical parallel batch machines
- A fast algorithm for multi-machine scheduling problems with jobs of equal processing times
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)