Results 31 to 40 of about 13,809 (278)
Bio-Inspired Workflow Scheduling on HPC Platforms
Efficient scheduling of tasks in workflows of cloud or grid applications is a key to achieving better utilization of resources as well as timely completion of the user jobs. Many scientific applications comprise several tasks that are dependent in nature
Mandeep Kaur, Sanjay Kadam
doaj
Minimizing makespan in hybrid flowshops
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA ( host institution ) +2 more
openaire +3 more sources
Multi-Task Simultaneous Supervision
This paper focuses on developing a Multi-Task Simultaneous Supervision Dual Resource-Constrained Scheduling (MTSSDRC) system that considers differences in skill between operators, aiming to minimize makespan and balance operator workload.
Afifah Rizka +2 more
doaj +1 more source
Minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms [PDF]
Resource-Constrained Project Scheduling Problem (RCPSP) is considered as an important project scheduling problem. However, increasing dimensions of a project, whether in number of activities or resource availability, cause unused resources through the ...
Baharudin, B. T. Hang Tuah +3 more
core +1 more source
A Self-Adaptive Memetic Algorithm for Distributed Job Shop Scheduling Problem
Distributed scheduling has become a common manufacturing mode, and the distributed job scheduling problem (DJSP) has attracted more manufacturers and researchers in the field of operation research.
Guangchen Wang +2 more
doaj +1 more source
Task stalling for a batch of task makespan minimisation in heterogeneous multigrid computing
This paper presents a new algorithm for a batch of task makespan minimisation in heterogeneous multigrid computing. Heterogeneous grids are known to cause straggling task problem that increases task execution makespan.
Albertas Jurgelevičius +2 more
doaj +1 more source
Makespan Minimization via Posted Prices [PDF]
We consider job scheduling settings, with multiple machines, where jobs arrive online and choose a machine selfishly so as to minimize their cost. Our objective is the classic makespan minimization objective, which corresponds to the completion time of the last job to complete. The incentives of the selfish jobs may lead to poor performance.
Michal Feldman, Amos Fiat, Alan Roytman
openaire +2 more sources
Makespan preserving flowshop reengineering via blocking constraints
Blocking constraints are ubiquitous in machine scheduling. In a flowshop scenario, a machine might get blocked by a job that has just been processed by the same machine.
Newton, MA Hakim +2 more
core +1 more source
A Novel Two‐Stage Flexible Flow Shop Batch Scheduling Model for Grinding Workshops
ABSTRACT The growing need for data storage in data centers has increased the demand for mechanical hard disks due to their low cost and high reliability. Aluminum substrates are the most popular base plates for mechanical hard disks because of their high hardness and low cost.
Jun Xu +4 more
wiley +1 more source

