Solution of The Liu-Layland Problem Via Bottleneck Just-In-Time Sequencing

Authors:
Wieslaw Kubiak
Affiliations:
Faculty of Business Administration, Memorial University of Newfoundland, St. John's, Canada A1B 3X5
Venue:
Journal of Scheduling
Year:
2005

Citing 7
Cited 1

A note on “level schedules for mixed-model assembly lines in just-in-time production systems”

Management Science
Level schedules for mixed-model, Just-in-Time processes

Management Science
Scheduling computer and manufacturing processes

Scheduling computer and manufacturing processes
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Liu and Layland's schedulability test revisited

Information Processing Letters
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications

Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
The maximum deviation just-in-time scheduling problem

Discrete Applied Mathematics

Survey: Complexity of cyclic scheduling problems: A state-of-the-art survey

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new approach to the well-known Liu--Layland periodic scheduling problem. This approach proves that any just-in-time sequence with maximum absolute deviation being less than one is in fact a periodic schedule. Consequently, periodic schedules can be obtained by any algorithm capable of generating just-in-time sequences with maximum absolute deviation being less than one, for instance, any algorithm minimizing maximum deviation or the quota methods of apportionment.