Scheduling Equal-Length Jobs with Delivery times on Identical Processors

DOI10.1080/00207160211288zbMath1024.68008OpenAlexW2169713267MaRDI QIDQ4551464

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

zbMATH Keywords

scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• The one-machine sequencing problem
• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
• On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
• Sequencing with due-dates and early start times to minimize maximum tardiness
• A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
• On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/F_max) problem

This page was built for publication: Scheduling Equal-Length Jobs with Delivery times on Identical Processors