An efficient simulation optimization methodology to solve a multi-objective problem in unreliable unbalanced production lines

MM Motlagh, P Azimi, M Amiri, G Madraki - Expert Systems with …, 2019 - Elsevier
This research develops an expert system to addresses a novel problem in the literature of
buffer allocation and production lines. We investigate real-world unreliable unbalanced …

Hybrid task scheduling method for cloud computing by genetic and DE algorithms

A Kamalinia, A Ghaffari - Wireless personal communications, 2017 - Springer
Cloud computing is a new technology which provides online services to the consumers. In
order to have a high efficiency in cloud computing, proper task scheduling is required. Since …

Review and classification of constructive heuristics mechanisms for no-wait flow shop problem

MS Nagano, HH Miyata - The International Journal of Advanced …, 2016 - Springer
Permutation flow shop scheduling has been studied since the 1950s. Due to practical
applications and because of its complex nature, several constrains have been studied, for …

[HTML][HTML] A mixed integer programming model for the cyclic job-shop problem with transportation

P Brucker, EK Burke, S Groenemeyer - Discrete applied mathematics, 2012 - Elsevier
This paper focuses on the study of cyclic job-shop problems with transportation and
blocking. Within this domain, there are many real world problems like large scale …

Max-stretch minimization on an edge-cloud platform

A Benoit, R Elghazi, Y Robert - 2021 IEEE international parallel …, 2021 - ieeexplore.ieee.org
We consider the problem of scheduling independent jobs that are generated by processing
units at the edge of the network. These jobs can either be executed locally, or sent to a …

Processing moldable tasks on the grid: Late job binding with lightweight user-level overlay

JT Mościcki, M Lamanna, M Bubak… - Future Generation …, 2011 - Elsevier
Independent observations and everyday user experience indicate that performance and
reliability of large grid infrastructures may suffer from large and unpredictable variations. In …

[PDF][PDF] Approximation in deterministic and stochastic machine scheduling

SJ Jäger - 2021 - depositonce.tu-berlin.de
Classical combinatorial optimization is based on the assumption that for a given problem
instance all problem data are available at the beginning (offline optimization). However …

Bi-criteria path problem with minimum length and maximum survival probability

N Halman, MY Kovalyov, A Quilliot, D Shabtay, M Zofi - OR Spectrum, 2019 - Springer
We study a bi-criteria path problem on a directed multigraph with cycles, where each arc is
associated with two parameters. The first is the survival probability of moving along the arc …

Decentralized list scheduling

M Tchiboukdjian, N Gast, D Trystram - Annals of Operations Research, 2013 - Springer
Classical list scheduling is a very popular and efficient technique for scheduling jobs for
parallel and distributed platforms. It is inherently centralized. However, with the increasing …

Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies

N Boland, T Kalinowski, S Kaur - Computers & Operations Research, 2015 - Elsevier
We consider a problem that marries network flows and scheduling, motivated by the need to
schedule maintenance activities in infrastructure networks, such as rail or general logistics …