Results 41 to 50 of about 2,111 (188)

A Load Balancing Algorithm for the Data Centres to Optimize Cloud Computing Applications

open access: yesIEEE Access, 2021
Despite the many past research conducted in the Cloud Computing field, some challenges still exist related to workload balancing in cloud-based applications and specifically in the Infrastructure as service (IaaS) cloud model.
Dalia Abdulkareem Shafiq   +3 more
doaj   +1 more source

Assessing second‐price auctions for parcel exchanges in last‐mile logistics

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract The rapid growth of e‐commerce has led to multiple carriers operating in the same regions, creating opportunities for collaboration. However, logistics companies typically operate independently, leading to inefficiencies. Horizontal cooperation, where carriers share resources and infrastructure, can improve efficiency and reduce costs.
Christian Truden, Margaretha Gansterer
wiley   +1 more source

A Mixed-Integer Linear Programming Model for Addressing Efficient Flexible Flow Shop Scheduling Problem with Automatic Guided Vehicles Consideration

open access: yesApplied Sciences
With the development of Industry 4.0, discrete manufacturing systems are accelerating their transformation toward flexibility and intelligence to meet the market demand for various products and small-batch production.
Dekun Wang   +6 more
doaj   +1 more source

Scheduling optimization of optical lens polishing

open access: yesInternational Transactions in Operational Research, Volume 33, Issue 6, Page 3744-3768, November 2026.
Abstract Optical systems have achieved notable progress in focusing and imaging technologies; however, manual grinding remains indispensable, resulting in elevated costs, extended timelines, and inefficiencies. These difficulties are compounded by operational constraints, uneven machine utilization, and risks of order delays and escalating expenses ...
Tzu‐Chin Lin, Bertrand M. T. Lin
wiley   +1 more source

Proportionally Fair Makespan Approximation

open access: yesProceedings of the AAAI Conference on Artificial Intelligence
We study fair mechanisms for the classic job scheduling problem on unrelated machines with the objective of minimizing the makespan. This problem is equivalent to minimizing the egalitarian social cost in the fair division of chores. The two prevalent fairness notions in the fair division literature are envy-freeness and proportionality. Prior work has
Michal Feldman   +3 more
openaire   +2 more sources

Enhancing Performance Analysis of OpenMP Task‐Based Applications: Enriched and Interactive Visualizations With StarVZ

open access: yesConcurrency and Computation: Practice and Experience, Volume 38, Issue 15, August 2026.
ABSTRACT OpenMP, a leading tool for loop‐based parallel programming on shared memory platforms, is becoming a more powerful environment for exploiting task‐based parallelism. Recent specification versions have added support for new task clauses, while the OMPT interface provides a standard API for performance monitoring. In this paper, we present a new
Vinícius Garcia Pinto   +1 more
wiley   +1 more source

A Simple and Effective Approach for Tackling the Permutation Flow Shop Scheduling Problem

open access: yesMathematics, 2021
In this research, a new approach for tackling the permutation flow shop scheduling problem (PFSSP) is proposed. This algorithm is based on the steps of the elitism continuous genetic algorithm improved by two strategies and used the largest rank value ...
Mohamed Abdel-Basset   +4 more
doaj   +1 more source

Optimization of Batch Centralized Health Examination Scheduling Considering Inter‐Item Transition Time and Sex Differences: An Empirical Optimization Study

open access: yesHealth Science Reports, Volume 9, Issue 8, August 2026.
ABSTRACT Background and Aims With increasing health awareness among Chinese residents, the demand for health examinations has continued to grow, placing mounting pressure on hospitals and health examination centers. This problem is particularly evident in group batch health examinations, where a large instantaneous flow of examinees and numerous ...
Mengdi Lv   +4 more
wiley   +1 more source

InterRC: An Inter-Resources Collaboration Heuristic for Scheduling Independent Tasks on Heterogeneous Distributed Environments

open access: yesMendel, 2019
The independent task scheduling problem in distributed computing environments with makespan optimization as an objective is an NP-Hard problem. Consequently, an important number of approaches looking to approximate the optimal makespan in reasonable time
Abdelhamid Khiat, Abdelkamel Tari
doaj   +1 more source

The Permutation Flow Shop Scheduling Problem with Human Resources: MILP Models, Decoding Procedures, NEH-Based Heuristics, and an Iterated Greedy Algorithm

open access: yesMathematics, 2022
In this paper, we address the permutation flow shop scheduling problem with sequence-dependent and non-anticipatory setup times. These setups are performed or supervised by multiple servers, which are renewable secondary resources (typically human ...
Victor Fernandez-Viagas   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy