Dynamic Scheduling in Inpatient Nursing

2009 ◽  
Vol 3 (2) ◽  
pp. 174-184 ◽  
Author(s):  
Mingang Cheng ◽  
◽  
Hiromi Itoh Ozaku ◽  
Noriaki Kuwahara ◽  
Kiyoshi Kogure ◽  
...  
Keyword(s):  
Simulated Annealing ◽  
Local Search ◽  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Work Hours ◽  
Scheduling Problems ◽  
Improve Efficiency ◽  
Inpatient Nursing

To shorten the notoriously long waits for service in hospitals in Japan and to improve efficiency, we propose a scheduling algorithm with a 2-layer local search based on simulated annealing -- permutating (switching) (i) tasks among nurses and (ii) subtasks on each nurse. The scheduling algorithm generates a solution initializing our proposed dynamic scheduling to iteratively generate new, feasible schedules based on the scheduling algorithm to accommodate interruptions while preventing nurses' work hours from increasing. To verify the effectiveness of our proposed scheduling, we executed a set of nursing scheduling problems taken from those actually observed and focused on those that featuring frequent interruptions.

scholarly journals A Study of Distributed Earth Observation Satellites Mission Scheduling Method Based on Game-Negotiation Mechanism

Sensors ◽  
2021 ◽  
Vol 21 (19) ◽  
pp. 6660
Author(s):  
Lihao Liu ◽  
Zhenghong Dong ◽  
Haoxiang Su ◽  
Dingzhan Yu
Keyword(s):  
Dynamic Scheduling ◽  
Environmental Changes ◽  
Search Algorithm ◽  
Integrated Management ◽  
Scheduling Algorithm ◽  
Earth Observation ◽  
Scheduling Problems ◽  
Satellite Systems ◽  
Earth Observation Satellites ◽  
Negotiation Mechanism

While monolithic giant earth observation satellites still have obvious advantages in regularity and accuracy, distributed satellite systems are providing increased flexibility, enhanced robustness, and improved responsiveness to structural and environmental changes. Due to increased system size and more complex applications, traditional centralized methods have difficulty in integrated management and rapid response needs of distributed systems. Aiming to efficient missions scheduling in distributed earth observation satellite systems, this paper addresses the problem through a networked game model based on a game-negotiation mechanism. In this model, each satellite is viewed as a “rational” player who continuously updates its own “action” through cooperation with neighbors until a Nash Equilibria is reached. To handle static and dynamic scheduling problems while cooperating with a distributed mission scheduling algorithm, we present an adaptive particle swarm optimization algorithm and adaptive tabu-search algorithm, respectively. Experimental results show that the proposed method can flexibly handle situations of different scales in static scheduling, and the performance of the algorithm will not decrease significantly as the problem scale increases; dynamic scheduling can be well accomplished with high observation payoff while maintaining the stability of the initial plan, which demonstrates the advantages of the proposed methods.

scholarly journals A CRITICAL ANALYSIS OF SIMULATORS IN GRID

2015 ◽  
Vol 77 (4) ◽  
Author(s):  
Omar Dakkak ◽  
Suki Arif ◽  
Shahrudin Awang Nor
Keyword(s):  
Distributed Computing ◽  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Research Area ◽  
Scheduling Problems ◽  
Computing Environment ◽  
Parallel And Distributed Computing ◽  
Energy Concept ◽  
To Come ◽  
Load Balancing Algorithm

In parallel and distributed computing environment such as "The Grid", anticipating the behavior of the resources and tasks based on certain scheduling algorithm is a great challenging. Thus, studying and improving these types of environments becomes very difficult. Out of this, the developers have spent remarkable efforts to come up with simulators which facilitate the studies in this domain. In addition, these simulators have a significant role in enhancing and proposing many scheduling algorithms, and this in turn has reflected efficiently on the Grid. In this paper, we will present some of these tools, which are: GridSim for large scales distributed computing and parallel environment, Alea for tackling dynamic scheduling problems, Sim-G-Batch grid simulator for simulating the security and energy concept and Balls simulator for evaluation peer-to-peer with integrated load balancing algorithm. Furthermore, this paper aims to guide and assist the researcher to choose the proper tool that can fit the studied research area, by providing functionality analysis for the reviewed simulators..

Dual priority dynamic scheduling algorithm based on multi-FPGA

2013 ◽  
Vol 33 (3) ◽  
pp. 862-865
Author(s):  
Shuangzhi DU ◽  
Yong WANG ◽  
Xiaoling TAO
Keyword(s):  
Dynamic Scheduling ◽  
Scheduling Algorithm

scholarly journals Dynamic Scheduling Algorithm based on NOMA Access and Priority Assignment for V2X communications

2020 ◽  
Vol 53 (2) ◽  
pp. 15041-15046
Author(s):  
Ala Din Trabelsi ◽  
Hend Marouane ◽  
Emna Bouhamed ◽  
Faouzi Zarai
Keyword(s):  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Priority Assignment

scholarly journals Dynamic Scheduling Algorithm in Cyber Mimic Defense Architecture of Volunteer Computing

2021 ◽  
Vol 21 (3) ◽  
pp. 1-33
Author(s):  
Qianmu Li ◽  
Shunmei Meng ◽  
Xiaonan Sang ◽  
Hanrui Zhang ◽  
Shoujin Wang ◽  
...  
Keyword(s):  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Dynamic Change ◽  
High Energy ◽  
Transformation Rule ◽  
Volunteer Computing ◽  
Attack Behavior ◽  
Time Threshold ◽  
Security And Reliability ◽  
Multi Level

Volunteer computing uses computers volunteered by the general public to do distributed scientific computing. Volunteer computing is being used in high-energy physics, molecular biology, medicine, astrophysics, climate study, and other areas. These projects have attained unprecedented computing power. However, with the development of information technology, the traditional defense system cannot deal with the unknown security problems of volunteer computing . At the same time, Cyber Mimic Defense (CMD) can defend the unknown attack behavior through its three characteristics: dynamic, heterogeneous, and redundant. As an important part of the CMD, the dynamic scheduling algorithm realizes the dynamic change of the service centralized executor, which can enusre the security and reliability of CMD of volunteer computing . Aiming at the problems of passive scheduling and large scheduling granularity existing in the existing scheduling algorithms, this article first proposes a scheduling algorithm based on time threshold and task threshold and realizes the dynamic randomness of mimic defense from two different dimensions; finally, combining time threshold and random threshold, a dynamic scheduling algorithm based on multi-level queue is proposed. The experiment shows that the dynamic scheduling algorithm based on multi-level queue can take both security and reliability into account, has better dynamic heterogeneous redundancy characteristics, and can effectively prevent the transformation rule of heterogeneous executors from being mastered by attackers.

Memetic Algorithm Approach to Two-Stage Hybrid Flow Shop Scheduling Problem with Identical Parallel Machines

2013 ◽  
Vol 651 ◽  
pp. 548-552
Author(s):  
Parinya Kaweegitbundit
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Parallel Machines ◽  
Flow Shop ◽  
Memetic Algorithm ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Scheduling Problems ◽  
Two Stage ◽  
Hybrid Flow Shop Scheduling

This paper considers two stage hybrid flow shop (HFS) with identical parallel machine. The objectives is to determine makespan have been minimized. This paper presented memetic algorithm procedure to solve two stage HFS problems. To evaluated performance of propose method, the results have been compared with two meta-heuristic, genetic algorithm, simulated annealing. The experimental results show that propose method is more effective and efficient than genetic algorithm and simulated annealing to solve two stage HFS scheduling problems.

Sign in / Sign up

Export Citation Format

Share Document