Understanding and using the capabilities of finite scheduling

Abstract

PurposePresents a microcomputer‐based finite scheduling approach to effective planning and execution of make‐to‐order production. Going beyond the traditional application of scheduling algorithms to prioritize jobs through work centers, the finite scheduling approach can be used to establish “smart” promise dates, manage the jobs through the work centers and enable supervisors to meet these due dates in the dynamic MTO environment.Design/methodology/approachUsing data from an operational jobshop and a simulation‐based finite scheduling algorithm linked to pre‐ and post‐processing capabilities developed in Access, this research provides specific examples of establishing smart due dates and managing resources to meet those dates. We provide some what‐ifs in order to more fully explore the benefits of a finite scheduling system.FindingsThrough use of actual jobshop data, the paper demonstrates that finite scheduling can be effectively performed on standard computing equipment. It also provides an understanding of finite scheduling and demonstrates that such a system can be of significant value in a MTO environment.Research limitations/implicationsFuture research could review/compare various ERP packages and their scheduling components to provide guidance on selection and implementation.Practical implicationsThe paper clearly indicates that managers, even of smaller companies, should be considering the use of finite scheduling.Originality/valueThe paper provides a new approach to finite scheduling using a combination of simulation and Microsoft Access on a personal computer. Additionally, it provides a very useful presentation for practitioners who want an understanding of finite scheduling and why they need to implement it.