Premium
A dynamic priority rule for scheduling against due‐dates
Author(s) -
Baker Kenneth R.,
Bertrand J.W.M.
Publication year - 1982
Publication title -
journal of operations management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.649
H-Index - 191
eISSN - 1873-1317
pISSN - 0272-6963
DOI - 10.1016/0272-6963(82)90020-1
Subject(s) - tardiness , computer science , simple (philosophy) , scheduling (production processes) , due date , set (abstract data type) , rule based system , operations research , production (economics) , dynamic priority scheduling , mathematical optimization , distributed computing , industrial engineering , job shop scheduling , artificial intelligence , mathematics , embedded system , economics , engineering , microeconomics , philosophy , routing (electronic design automation) , epistemology , programming language , queue , schedule , operating system
We simulate the performance of a simple production system in which due‐dates are set internally. We investigate priority rules aimed at minimizing tardiness, emphasizing a “modified duedate rule” which functions effectively in conjunction with internally‐set deadlines and which adapts to both tight and loose conditions in the due‐dates. This rule is simple and logical, and shows considerable promise for application in complex production systems.