Search
Now showing items 1-10 of 15
An energy-efficient single machine scheduling with release dates and sequence-dependent setup times
(GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion, 2018)
This study considers single machine scheduling with the machine operating at varying speed levels for different jobs with release dates and sequence-dependent setup times, in order to examine the trade-off between makespan ...
A variable block insertion heuristic for permutation flowshops with makespan criterion
(2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings, 2017)
This paper proposes a populated variable block insertion heuristic (PVBIH) algorithm for solving the permutation flowshop scheduling problem with the makespan criterion. The PVBIH algorithm starts with a minimum block size ...
Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
(Computers and Operations Research, 2017)
Recently, iterated greedy algorithms have been successfully applied to solve a variety of combinatorial optimization problems. This paper presents iterated greedy algorithms for solving the blocking flowshop scheduling ...
A populated local search with differential evolution for blocking flowshop scheduling problem
(2015 IEEE Congress on Evolutionary Computation, CEC 2015 - Proceedings, 2015)
This paper presents a populated local search algorithm through a differential evolution algorithm for solving the blocking flowshop scheduling problem under makespan criterion. Iterated greedy and iterated local search ...
A differential evolution algorithm with variable neighborhood search for multidimensional knapsack problem
(2015 IEEE Congress on Evolutionary Computation, CEC 2015 - Proceedings, 2015)
This paper presents a differential evolution algorithm with a variable neighborhood search to solve the multidimensional knapsack problem. Unlike the studies employing check and repair operators, we employ some sophisticated ...
An iterated greedy algorithm for the hybrid flowshop problem with makespan criterion
(IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - CIPLS 2014: 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems, Proceedings, 2014)
The main contribution of this paper is to present some novel constructive heuristics for the the hybrid flowshop scheduling (HFS) problem with the objective of minimizing the makespan for the first time in the literature. ...
A Variable Block Insertion Heuristic for Solving Permutation Flow Shop Scheduling Problem with Makespan Criterion
(MDPI, 2019)
In this paper, we propose a variable block insertion heuristic (VBIH) algorithm to solve the permutation flow shop scheduling problem (PFSP). The VBIH algorithm removes a block of jobs from the current solution. It applies ...
Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
(PERGAMON-ELSEVIER SCIENCE LTD, 2017)
Recently, iterated greedy algorithms have been successfully applied to solve a variety of combinatorial optimization problems. This paper presents iterated greedy algorithms for solving the blocking flowshop scheduling ...
A variable block insertion heuristic for permutation flowshops with makespan criterion
(IEEE, 2017)
This paper proposes a populated variable block insertion heuristic (PVBIH) algorithm for solving the permutation flowshop scheduling problem with the makespan criterion. The PVBIH algorithm starts with a minimum block size ...
A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion
(MDPI AG, 2016)
In this paper, we present a variable block insertion heuristic (VBIH) algorithm to solve the blocking flowshop scheduling problem with the total flowtime criterion. In the VBIH algorithm, we define a minimum and a maximum ...
[email protected] by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
