Dynamic Programming algorithms and their applications in machine scheduling: A review
This paper aims at presenting a compilation of state-of art references in which dynamic
programming (DP) and its variants have been applied as a solution methods for the …
programming (DP) and its variants have been applied as a solution methods for the …
On the approximability of trade-offs and optimal access of web sources
We study problems in multiobjective optimization, in which solutions to a combinatorial
optimization problem are evaluated with respect to several cost criteria, and we are …
optimization problem are evaluated with respect to several cost criteria, and we are …
[HTML][HTML] A survey of scheduling with controllable processing times
D Shabtay, G Steiner - Discrete Applied Mathematics, 2007 - Elsevier
In classical deterministic scheduling problems, the job processing times are assumed to be
constant parameters. In many practical cases, however, processing times are controllable by …
constant parameters. In many practical cases, however, processing times are controllable by …
A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
C Koulamas, GJ Kyparisis - European Journal of Operational Research, 2023 - Elsevier
We review dynamic programming (DP) algorithms utilized to solve offline deterministic
single-machine scheduling problems. We classify DP algorithms based on problem …
single-machine scheduling problems. We classify DP algorithms based on problem …
A multi-objective linear programming model for scheduling part families and designing a group layout in cellular manufacturing systems
Different industries compete to attract customers in different ways. In the field of production,
group technology (GT) is defined by identifying and grou** similar parts based on their …
group technology (GT) is defined by identifying and grou** similar parts based on their …
A tabu search algorithm for unrelated parallel machine scheduling with sequence-and machine-dependent setups: minimizing total tardiness
This study considers the problem of scheduling independent jobs on unrelated parallel
machines with machine-and sequence-dependent setup times for the objective of …
machines with machine-and sequence-dependent setup times for the objective of …
Multiobjective query optimization
The optimization of queries in distributed database systems is known to be subject to
delicate trade-offs. For example, the Mariposa database system allows users to specify a …
delicate trade-offs. For example, the Mariposa database system allows users to specify a …
Approximation quality of the hypervolume indicator
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multi-
objective optimizers use indicator functions to guide the search and to evaluate the …
objective optimizers use indicator functions to guide the search and to evaluate the …
A fast approximation-guided evolutionary multi-objective algorithm
Approximation-Guided Evolution (AGE)[4] is a recently presented multi-objective algorithm
that outperforms state-of-the-art multi-multi-objective algorithms in terms of approximation …
that outperforms state-of-the-art multi-multi-objective algorithms in terms of approximation …
Scheduling two agents with controllable processing times
We consider several two-agent scheduling problems with controllable job processing times,
where agents A and B have to share either a single machine or two identical machines in …
where agents A and B have to share either a single machine or two identical machines in …