Search
Now showing items 11-20 of 162
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 ...
A General Variable Neighborhood Search for the No-Idle Flowshop Scheduling Problem with Makespan Criterion
(IEEE, 2019)
This paper proposes a novel general variable neighborhood search (GVNS) algorithm to solve the no-idle flowshop scheduling problem with the makespan criterion. The initial solution of the GVNS is generated using the FRB5 ...
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 ...
Iterated greedy algorithms for the hybrid flowshop scheduling with total flow time minimization
(GECCO 2018 - Proceedings of the 2018 Genetic and Evolutionary Computation Conference, 2018)
1 The hybrid flosshop scheduling problem (HFSP) has been extensively studied in the literature, due to its complexity and real-life applicability. Various exact and heuristic algorithms have been developed for the HFSP, ...
Energy-efficient single machine total weighted tardiness problem with sequence-dependent setup times
(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018)
Most of the problems defined in the scheduling literature do not yet take into account the energy consumption of manufacturing processes, as in most of the variants with tardiness objectives. This study handles scheduling ...
Green Permutation Flowshop Scheduling: A Trade- off- Between Energy Consumption and Total Flow Time
(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018)
Permutation flow shop scheduling problem (PFSP) is a well-known problem in the scheduling literature. Even though many multi-objective PFSPs are presented in the literature with the objectives related to production efficiency ...
Variable block insertion heuristic for the quadratic assignment problem
(2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings, 2017)
The aim of this paper is to apply the variable block insertion heuristic (VBIH) algorithm recently proposed in the literature for solving the quadratic assignment problem (QAP). The VBIH algorithm is concerned with making ...
Design of multi-product multi-period two-echelon supply chain network to minimize bullwhip effect through differential evolution
(2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings, 2017)
A supply chain network consists of facilities located in dispersed geographical locations. This network structure can be optimized to minimize total cost or total inventory by deciding the order quantities and distribution ...
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 ...