Traditionally, project scheduling and material planning have been treated independently. In this research, a mixed integer programming model is presented to integrate project scheduling and materials ordering problems. The goal is to minimize the total material holding and ordering costs. In addition, an efficient metaheuristic algorithm is proposed to solve the model. The proposed algorithm is...

In this paper, we develop a method to check the schedulability superframe with beacon-enabled mode in ISA100.11a Wireless Industrial Networks environment. Maximum length of time slot is added in the superframe to reduce the overhead, and deadline monotonic scheduling approach is proposed to analyze the system scenario. The simulation results indicate that our proposed method required less numbe...

This paper deals with a single machine scheduling problem with availability constraints. The jobs are splitable and lower bound on the size of each sub-job is imposed. The objective is to find a feasible schedule that minimizes the makespan. The proposed scheduling problem is proved to be NP-hard in the strong sense. Some effective heuristic algorithms are then proposed. Additionally, computati...

Distributed real-time applications require efficient scheduling to improve processor and network utilization, and to avoid missing task deadlines. Current scheduling algorithms typically do not utilize applicationlevel information nor do they adapt to changes in application state. We describe a system in which users define dynamic, application-specific, scheduling policies using a fuzzy-logic a...

Response time is one of the characteristics of scheduler, happens to be a prominent attribute of any CPU scheduling algorithm. The proposed New Multi Level Feedback Queue [NMLFQ] Scheduler is compared with dynamic, real time, Dependent Activity Scheduling Algorithm (DASA) and Locke’s Best Effort Scheduling Algorithm (LBESA). We abbreviated beneficial result of NMLFQ scheduler in comparison with...