(1) In a goal-programming problem, a statement that stipulates the ordering of the goals, so that a solution that satisfies the priority k goal is always to be preferred to solutions that satisfy the lower priority goals k + 1,.... Goal programming. (2) In queueing theory, this means that an arriving higher priority item pushes a lower one out of service because the newcomer has higher priority. Service of the preempted customer can either continue from the point of its interruption or totally start anew. Queueing theory.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Preemption . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_785
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_785
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive