Search
Now showing items 31-40 of 79
A Discrete Artificial Bee Colony Algorithm for the Permutation Flowshop Scheduling Problem with Sequence-Dependent Setup Times
(IEEE, 2016)
A discrete artificial bee colony ( DABC) algorithm for the permutation flowshop scheduling problem with sequence-dependent setup times (PFSP-SDST) is presented in this paper. PFSP-SDST is an important problem that has ...
Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion
(PERGAMON-ELSEVIER SCIENCE LTD, 2015)
This study investigates the flexible job shop scheduling problem (FJSP) with new job insertion. FJSP with new job insertion includes two phases: initializing schedules and rescheduling after each new job insertion. ...
A Multi-Objective Self-Adaptive Differential Evolution Algorithm for Conceptual High-Rise Building Design
(IEEE, 2016)
This paper presents a multi-objective self-adaptive differential evolution algorithm to solve the form-finding problem of high-rise building design in the conceptual phase. The aim of the research is to reach suitable ...
An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time
(TAYLOR & FRANCIS LTD, 2015)
This study addresses flexible job shop scheduling problem (FJSP) with fuzzy processing time. The fuzzy or uncertainty of processing time is one of seven characteristics in remanufacturing. A discrete harmony search (DHS) ...
Lagrangian heuristic for scheduling a steelmaking-continuous casting process
(IEEE, 2013)
One of the biggest bottlenecks in iron and steel production is the steelmaking-continuous casting (SCC) process, which consists of steel-making, re ning and continuous casting. The production scheduling of SCC is a complex ...
A Discrete Artificial Bee Colony Algorithm for the Team Orienteering Problem with Time Windows
(IEEE, 2013)
This paper presents a discrete artificial bee colony algorithm (DABC) for solving the team orienteering problem with time windows (TOPTW). The proposed algorithm employs a destruction and construction procedure to generate ...
A DE Based Variable Iterated Greedy Algorithm for the No-Idle Permutation Flowshop Scheduling Problem with Total Flowtime Criterion
(SPRINGER-VERLAG BERLIN, 2012)
In this paper, we present a variable iterated greedy (vIGP_DE) algorithm where its parameters (basically destruction size and cooling parameter for the simulated annealing type of acceptance criterion) are optimized by the ...
A Discrete Harmony Search Algorithm for the Economic Lot Scheduling Problem with Power of Two Policy
(IEEE, 2012)
In this paper, we present a problem specific discrete harmony search (DHS) algorithms to solve the economic lot scheduling problem (ELSP) under the extended basic period (EBP) approach and power-of-two (PoT) policy. In ...
Evolutionary Computation for Architectural Design of Restaurant Layouts
(IEEE, 2015)
This paper presents the results obtained by NSGA-II and DE on a restaurant layout optimization problem, trying to maximize total profit while minimizing investment. The problem entails the configuration of restaurant ...
A Populated Local Search with Differential Evolution for Blocking Flowshop Scheduling Problem
(IEEE, 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 ...