Solution of the Liu-Layland problem via bottleneck just-in-time sequencing

DOI10.1007/s10951-005-1638-5zbMath1123.90029OpenAlexW2032016870MaRDI QIDQ880504

Wiesław X. Kubiak

Publication date: 15 May 2007

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

Full work available at URL: https://doi.org/10.1007/s10951-005-1638-5

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Apportionment methods and the Liu-Layland problem

Cites Work

• Liu and Layland's schedulability test revisited
• The Chairman assignment problem
• The maximum deviation just-in-time scheduling problem.
• On small deviations conjecture
• A Class of New Methods for Congressional Apportionment
• A Note on “Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems”
• The Quota Method of Apportionment
• Level Schedules for Mixed-Model, Just-in-Time Processes
• Maximum matching in a convex bipartite graph
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solution of the Liu-Layland problem via bottleneck just-in-time sequencing