Graphs are powerful tools to model manufacturing systems and scheduling problems. The complexity of these their problems has been substantially increased by the ongoing technological development. Thus, it is essential generate sustainable graph-based modeling approaches deal with excessive complexities. employ nodes edges represent relationships between jobs, machines, operations, etc. Despite ...

A distribution-graph based scheduling algorithm is proposed together with an extended tree growing technique to deal with the problem of unequal-length block-test scheduling under power dissipation constraints. The extended tree growing technique is used in combination with the classical scheduling approach in order to improve the test concurrency having assigned power dissipation limits. Its g...

Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...

This study is concerned with how the quality of perishable products can be improved by shortening the time interval between production and distribution. As special types of food such as dairy products decay fast, the integration of production and distribution scheduling (IPDS) is investigated. An integrated scheduling of both processes improves the performance and costs because the separated sc...

In this paper, we present a novel approach to designing cellular automata-based multiprocessor scheduling algorithms in which extracting knowledge about the scheduling process occurs. This knowledge can potentially be used while solving new instances of the scheduling problem. We consider the simplest case when a multiprocessor system is limited to two-processors, but we do not imply any limita...

Applications in data-parallel computing typically consist of multiple stages. In each stage, a set intermediate parallel data flows ( Coflow ) is produced and transferred between servers to enable starting next stage. While there has been much research on scheduling isolated coflows, the depend...

Wireless link scheduling is one of the major challenging issues in multi hop wireless networks when they need to be designed in distributed fashion. In this work we improve the general randomized scheduling method by using learning automata based framework that allows throughput optimal scheduling algorithms could be developed in distributed fashion. We propose a distributed scheduling algorith...