Results 81 to 90 of about 25,495 (197)

Hybrid Flow Shop Scheduling Problems Using Improved Fireworks Algorithm for Permutation

open access: yesApplied Sciences, 2020
Prior studies are lacking which address permutation flow shop scheduling problems and hybrid flow shop scheduling problems together to help firms find the optimized scheduling strategy.
Xuelian Pang   +4 more
doaj   +1 more source

Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines

open access: yes, 2011
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job $j$ has a length $l_{j}$ and each machine $i$ has a private speed $t_{i}$.
Fleischer, Lisa, Wang, Zhenghui
core   +2 more sources

Sequencing situations with position‐dependent effects under cooperation

open access: yesInternational Transactions in Operational Research, Volume 32, Issue 3, Page 1620-1640, May 2025.
Abstract This paper innovatively addresses the effect of cooperation on sequencing situations with position‐dependent effects. Specifically, we ensure the convexity of the associated sequencing games under the fulfillment of certain conditions related to the neighbor switching gains.
A. Saavedra‐Nieves   +2 more
wiley   +1 more source

The role of drones in disaster response: A literature review of operations research applications

open access: yesInternational Transactions in Operational Research, Volume 32, Issue 2, Page 545-589, March 2025.
Abstract The increasing use of drones has led to growing interest in their potential applications in disaster response. In this study, we examine the role of drones in disaster management under three categories of operation types, which are information collection, delivery, and communication network recovery.
Ecem Yucesoy, Burcu Balcik, Elvin Coban
wiley   +1 more source

Special cases of online parallel job scheduling [PDF]

open access: yes, 2007
In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, where the next job becomes known as soon as the current job is scheduled ...
Hurink, Johann L., Paulus, Jacob Jan
core   +3 more sources

Santa Claus Schedules Jobs on Unrelated Machines

open access: yes, 2010
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelated machines, i.e., job j requires time p_{ij} if processed on machine i ...
Svensson, Ola
core   +3 more sources

An Efficient Services Placement for Optimizing the Energy Consumption in Volunteer Cloud Computing

open access: yesConcurrency and Computation: Practice and Experience, Volume 37, Issue 3, 1 February 2025.
ABSTRACT Volunteer Cloud computing, like traditional Cloud computing, has gained significant importance due to its ability to harness resources from individual personal machines, contributed voluntarily by their owners. In this paradigm, personal machine resources are shared voluntarily by their owners.
Omar Ben Maaouia   +3 more
wiley   +1 more source

New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics [PDF]

open access: yes, 2018
This paper addresses the hybrid flow shop scheduling problem to minimise makespan, a well-known scheduling problem for which many constructive heuristics have been proposed in the literature. Nevertheless, the state of the art is not clear due to partial
Fernández-Viagas Escudero, Víctor   +2 more
core  

Behavior of the main parameters of the Genetic Algorithm for Flow Shop Scheduling Problems

open access: yesRevista Cubana de Ciencias Informáticas, 2014
There are different suggested values to adapt the basic parameters of a Genetic Algorithm, however, these values may not be the optimal for all kinds of applications.
Yunior César Fonseca Reyna   +3 more
doaj  

A Hybrid Crow Search Algorithm for Solving Permutation Flow Shop Scheduling Problems

open access: yesApplied Sciences, 2019
The permutation flow shop scheduling problem (PFSP) is a renowned problem in the scheduling research community. It is an NP-hard combinatorial optimization problem that has useful real-world applications.
Ko-Wei Huang   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy