Although there are a number survey papers for production scheduling such as Ouelhadj and Petrovic [109] and Hart et al. [43], they just focused on traditional meta-heuristics to find optimal solutions for a set of static scheduling instances.
As turns out, resulting behavior is k-periodic, thus amenable to static scheduling.
Most publications in shop scheduling area focus on the static scheduling problems and seldom take into account the dynamic disturbances such as machine breakdown or new job arrivals.
We propose two variations of an incremental static scheduling scheme: one based on the steepest descent insertion, called OR1, and the other, on multistage rescheduling, called OR2.
Nevertheless, all these approaches are based on a fixed priority static scheduling technique.
This new control network, referred to as time-triggered controller area network, defines a session layer protocol for CAN, which is based on a static schedule time-triggered paradigm and provides intrinsic deterministic behaviour.
It considered a static scheduling of independent jobs on homogeneous single-core resources.
Using the AAM methodology from [6], a code can be generated from the static scheduling of the input algorithm on the input architecture (see workflow in Figure 8).
Thus, we support an approach that does not rely on controlability of individual nodes but rather does a processor-wide adaptation of power settings.Dynamic vs. static scheduling.
Improvement/greedy heuristics is used to iteratively improve the quality of schedules in static scheduling problems.
