Scheduling processes have been applied to a large category of application areas such as processor scheduling in operating systems, assembly line balancing in factories, vehicle routing and scheduling in logistics and timetabling in public transportation, etc. In general, scheduling problems are not trivial to solve due to complex constraints. In this paper, we consider reusability and run-time evolvability as two important quality attributes to develop cost-effective software systems with schedulers. Although many proposals have been presented to enhance these quality attributes in general-purpose software development practices, there has been hardly any publication within the context of designing scheduling systems. This paper presents an application framework called First Scheduling Framework (FSF) to design and implement schedulers with a high-degree of reusability and run-time evolvability. The utility of the framework is demonstrated with a set of canonical examples and evolution scenarios. The framework is fully implemented and tested.
|Number of pages||35|
|Publication status||E-pub ahead of print/First online - 28 Aug 2018|
|Event||PATAT 2018: 12th International Conference on the Practice and Theory of Automated Timetabling - TU Wien Faculty of Electrical Engineering, Vienna, Austria|
Duration: 28 Aug 2018 → 31 Aug 2018
Conference number: 12
|Abbreviated title||PATAT 2018|
|Period||28/08/18 → 31/08/18|