A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops

MF Tasgetiren, QK Pan, PN Suganthan, AHL Chen - Information sciences, 2011 - Elsevier
Obtaining an optimal solution for a permutation flowshop scheduling problem with the total
flowtime criterion in a reasonable computational timeframe using traditional approaches and …

Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems

G Minella, R Ruiz, M Ciavotta - Computers & Operations Research, 2011 - Elsevier
Multi-objective optimisation problems have seen a large impulse in the last decades. Many
new techniques for solving distinct variants of multi-objective problems have been proposed …

Circle detection using discrete differential evolution optimization

E Cuevas, D Zaldivar, M Pérez-Cisneros… - Pattern Analysis and …, 2011 - Springer
This paper introduces a circle detection method based on differential evolution (DE)
optimization. Just as circle detection has been lately considered as a fundamental …

A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion

MF Tasgetiren, QK Pan, PN Suganthan… - International Journal of …, 2011 - Taylor & Francis
In this paper, we investigate the use of a continuous algorithm for the no-idle permutation
flowshop scheduling (NIPFS) problem with tardiness criterion. For this purpose, a differential …

A novel ant colony algorithm for the single-machine total weighted tardiness problem with sequence dependent setup times

F Ahmadizar, L Hosseini - International Journal of Computational …, 2011 - Springer
This paper deals with the NP-hard single-machine total weighted tardiness problem with
sequence dependent setup times. Incorporating fuzzy sets and genetic operators, a novel …

Scheduling in stochastic bicriteria single machine systems with set up times

HM Soroush - International Journal of Planning and …, 2011 - inderscienceonline.com
This paper deals with a single machine scheduling problem where job attributes are random
variables, setup times are sequence dependent, and a scheduler utilises a cost function to …

Differential evolution for a constrained combinatorial optimisation problem

M Randall - International Journal of Metaheuristics, 2011 - inderscienceonline.com
Differential evolution (DE) has been extensively applied to continuous problems, its
mechanics naturally lending themselves to such. While some efforts have been made to …

A new scater search approach for the singe machine total weighted tardiness scheduling problem with sequence-dependent setup times

Q Guo, L Tang - The Fourth International Workshop on …, 2011 - ieeexplore.ieee.org
In this paper, we propose a scatter search based meta-heuristic algorithm to solve the single
machine total weighted tardiness problem with sequence-dependent setup times. Both …

[图书][B] Approches hybrides pour la résolution d'un problème d'ordonnancement industriel

A Sioud - 2011 - constellation.uqac.ca
Dans plusieurs secteurs d'activités industrielles comme la sidérurgie, la métallurgie, la
pétrochimie, la papeterie, l'aéronautique, l'industrie de la céramique ou celle de …

A methodology for scheduling jobs in a flexible flowshop with sequence dependent setup times and machine skipping

V Pandya - 2011 - ir.library.oregonstate.edu
A flexible flowshop, comprised of one or more stages having unrelated parallel machines, is
investigated in this research. Unrelated parallel machines can perform the same function but …