Search
Now showing items 1-10 of 12
A variable iterated greedy algorithm for the traveling salesman problem with time windows
(Information Sciences, 2014)
This paper presents a variable iterated greedy algorithm for solving the traveling salesman problem with time windows (TSPTW) to identify a tour minimizing the total travel cost or the makespan, separately. The TSPTW has ...
An artificial bee colony algorithm for the economic lot scheduling problem
(International Journal of Production Research, 2014)
In this study, we present an artificial bee colony (ABC) algorithm for the economic lot scheduling problem modelled through the extended basic period (EBP) approach. We allow both power-of-two (PoT) and non-power-of-two ...
A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities
(Applied Mathematical Modelling, 2014)
This paper presents a novel discrete artificial bee colony (DABC) algorithm for solving the multi-objective flexible job shop scheduling problem with maintenance activities. Performance criteria considered are the maximum ...
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 discrete artificial bee colony algorithm for the Economic Lot Scheduling problem with returns
(Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014, 2014)
In this study, we model the Economic Lot Scheduling problem with returns (ELSPR) under the basic period (BP) policy with power-of-two (PoT) multipliers, and solve it with a discrete artificial bee colony (DABC) algorithm. ...
A discrete artificial bee colony algorithm for the assignment and parallel machine scheduling problem in DYO paint company
(Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014, 2014)
This paper presents a discrete artificial bee colony algorithm to solve the assignment and parallel machine scheduling problem in DYO paint company. The aim of this paper is to develop some algorithms to be employed in the ...
An Iterated Greedy Algorithm for the Hybrid Flowshop Problem with Makespan Criterion
(IEEE, 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 Discrete Artificial Bee Colony Algorithm for the Economic Lot Scheduling Problem with Returns
(IEEE, 2014)
In this study, we model the Economic Lot Scheduling problem with returns (ELSPR) under the basic period (BP) policy with power-of-two (PoT) multipliers, and solve it with a discrete artificial bee colony (DABC) algorithm. ...
A Discrete Artificial Bee Colony Algorithm for the Assignment and Parallel Machine Scheduling Problem in DYO Paint Company
(IEEE, 2014)
This paper presents a discrete artificial bee colony algorithm to solve the assignment and parallel machine scheduling problem in DYO paint company. The aim of this paper is to develop some algorithms to be employed in the ...
A variable iterated greedy algorithm for the traveling salesman problem with time windows
(ELSEVIER SCIENCE INC, 2014)
This paper presents a variable iterated greedy algorithm for solving the traveling salesman problem with time windows (TSPTW) to identify a tour minimizing the total travel cost or the makespan, separately. The TSPTW has ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
