Abstract
Abstract A fundamental result in the theory of scheduling is the optimality of the shortest processing time (SPT) rule for minimizing mean flow time in the basic single-machine scheduling problem. The relationship between flow time and inventory also makes this rule an appropriate one to use if the objective is one of rapid turnaround, even when the scheduling environment is dynamic (i.e., where jobs arrive over time). This paper presents a case study where the principle behind SPT sequencing was used for a job shop bus maintenance operation. The results obtained by this implementation are further evidence that the application of SPT sequencing can yield significant improvements in scenarios considerably more complex than the basic single-machine scheduling problem.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
