A study of single-machine scheduling problem to maximize throughput

DOI10.1007/S10951-012-0307-8zbMath1297.90059OpenAlexW2079322303MaRDI QIDQ398860

Nodari Vakhania

Publication date: 18 August 2014

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

Full work available at URL: https://doi.org/10.1007/s10951-012-0307-8

zbMATH Keywords

algorithmschedulingsingle-machinerelease timedue-date

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Theoretical expectation versus practical performance of Jackson's heuristic ⋮ Fast solution of single-machine scheduling problem with embedded jobs ⋮ Dispersing points on intervals

Cites Work

• A note on scheduling equal-length jobs to maximize throughput
• Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
• Branch less, cut more and minimize the number of late equal-length jobs on identical machines
• Complexity results for single-machine problems with positive finish-start time-lags
• Parallel machine problems with equal processing times: a survey
• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
• A better algorithm for sequencing with release and delivery times on identical machines
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Unnamed Item

This page was built for publication: A study of single-machine scheduling problem to maximize throughput