The paper introduces a mechanism to implement distributed scheduling for CAN-bus resource in order to meet the requirements of a dynamic distributed real-time system. The key issues considered here, are multicasting, distinguishing between hard real-time, soft real-time, and non real-time constraints, achieving high resource utilization for CAN-bus, and supporting dynamic hard real-time computi...

This paper describes a new hybrid technique that combines a Greedy Randomized Adaptive Search Procedure (GRASP) and a genetic algorithm with simulation features in order to solve the Bus-Network Scheduling Problem (BNSP). The GRASP is used as an initialization method to find the routes between bus stops. The Genetic Algorithm is used to find the whole configuration of the bus network, together ...

This paper proposes a new formulation for the school bus scheduling problem (SBSP) which optimizes starting times for schools and associated bus routes to minimize transportation cost. Specifically, the problem determines the minimum number of buses required to complete all bus routes under the constraint that routes for the same school must arrive within a set time window before that school st...

This paper proposes a new formulation for the school bus scheduling problem (SBSP), which optimizes start times and operation to minimize transportation cost. The goal is number of buses serve all routes such that each route arrives in time window before starts. We show introducing context-specific features, common many districts, can lead time-indexed integer linear programming (ILP) formulati...

1. We propose a technique for test scheduling and design of test bus infrastructure where test application time and test bus length and width are minimized while constraints on power consumption and test resources are considered. Our approach is suitable for repeated use in the design space exploration process due to its low computational cost. For the final design, we use simulated annealing t...

The paper introduces a mechanism to implement distributed scheduling for the CAN-bus resource in order to meet the requirements of a dynamic distributed real-time system. The key issues considered here are multicasting, distinguishing between hard real-time, soft real-time, and non-real-time constraints, achieving high resource utilization for the CAN-bus, and supporting dynamic hard real-time ...

The paper introduces a mechanism to implement distributed scheduling for CAN-bus resource in order to meet the requirements of a dynamic distributed real-time system. The key issues considered here, are multicasting, distinguishing between hard real-time, soft real-time, and non real-time constraints, achieving high resource utilization for CAN-bus, and supporting dynamic hard real-time computi...