Sentence examples for machine scheduling algorithm from inspiring English sources
Based on this estimation model, we also propose a virtual machine scheduling algorithm that can provide computing resources according to the energy budget of each virtual machine.
The online machine minimization problem seeks to design a preemptive scheduling algorithm on multiple machines — each job j arrives at its release time rj, has to be processed for pj time units, and must be completed by its deadline dj.
This promising result may be of interests to industrial practitioners and academic researchers in the field of evolutionary algorithm or machine scheduling.
The proposed algorithm solves the single machine scheduling problems with earliness/tardiness cost in a just-in-time scheduling environment.
Khorshidian et al. (2011) developed a mathematical model using genetic algorithm for JIT single machine scheduling with pre-emption and machine idle time.
Luo et al. proposed polynomial algorithms for a single machine scheduling with flexible maintenance and various objective functions (Luo et al. 2015).
In this paper we propose a two-stage multi-population genetic algorithm (MPGA) to solve parallel machine scheduling problems with multiple objectives.
In [14] Lin et al., proposed a Dynamic Round-Robin (DRR) algorithm for energy-aware virtual machine scheduling and consolidation during which VMs are moved from the retired physical machine to other physical machines in duty.
This paper develops a meta-heuristic algorithm based on the concept of the vibration damping in mechanical vibration, called vibration damping optimization (VDO) algorithm for optimizing the identical parallel machine scheduling problem with sequence-independent family setup times.
In addition, a feed rate scheduling algorithm is proposed to maximize the machining efficiency subject to the cutting force constraint and the kinematical constraints of a specific machine configuration.
In this work a genetic algorithm is presented for the unrelated parallel machine scheduling problem in which machine and job sequence dependent setup times are considered.
