A better algorithm for sequencing with release and delivery times on identical machines

DOI10.1016/S0196-6774(03)00072-5zbMath1079.90063OpenAlexW2034265478MaRDI QIDQ4458881

Nodari Vakhania

Publication date: 14 March 2004

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-6774(03)00072-5

zbMATH Keywords

SchedulingIdentical machinesRelease time

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (9)

Theoretical expectation versus practical performance of Jackson's heuristic ⋮ Parallel batch scheduling of equal-length jobs with release and due dates ⋮ Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time ⋮ Branch less, cut more and minimize the number of late equal-length jobs on identical machines ⋮ A study of single-machine scheduling problem to maximize throughput ⋮ Bicriteria multi-machine scheduling with equal processing times subject to release dates ⋮ Parallel machine problems with equal processing times: a survey ⋮ Theoretical and practical issues in single-machine scheduling with two job release and delivery times ⋮ Scheduling a single machine with primary and secondary objectives

This page was built for publication: A better algorithm for sequencing with release and delivery times on identical machines