Author
Now showing items 1-12 of 12
-
A discrete artificial bee colony algorithm for the energy-efficient no-wait flowshop scheduling problem
(Procedia Manufacturing, 2019)No-wait permutation flow shop scheduling problem (NWPFSP) is a variant of permutation flow shop scheduling problem (PFSP), where the processing of each job must be continuous from start to end without any interruption. ... -
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 ... -
A General Variable Neighborhood Search for the NoIdle Flowshop Scheduling Problem with Makespan Criterion
(2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019, 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 ... -
A memetic algorithm for the bi-objective quadratic assignment problem
(Procedia Manufacturing, 2019)Recently, multi-objective evolutionary algorithms (MOEAs) have been extensively used to solve multi-objective optimization problems (MOPs) since they have the ability to approximate a set of non-dominated solutions in ... -
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 variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
(Algorithms, 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 Variable Iterated Local Search Algorithm for Energy-Efficient No-idle Flowshop Scheduling Problem
(Procedia Manufacturing, 2019)No-idle permutation flowshop scheduling problem (NIPFSP) is a well-known NP-hard problem, in which each machine must perform the jobs consecutively without any idle time. Even though various algorithms have been proposed ... -
An Adaptive Iterated Greedy algorithm for distributed mixed no-idle permutation flowshop scheduling problems
(Elsevier, 2021-06)Distributed flow shop scheduling is a very interesting research topic. This paper studies the distributed permutation flow shop scheduling problem with mixed no-idle constraints, which have important applications in practice. ... -
An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption
(PERGAMON-ELSEVIER SCIENCE LTD, 2020)In manufacturing scheduling, sustainability concerns that raise from the service-oriented performance criteria have seldom been studied in the literature. This study aims to fill this gap in the literature by integrating ... -
An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption
(Computers and Industrial Engineering, 2020)In manufacturing scheduling, sustainability concerns that raise from the service-oriented performance criteria have seldom been studied in the literature. This study aims to fill this gap in the literature by integrating ... -
Ensemble of metaheuristics for energy-efficient hybrid flowshops: Makespan versus total energy consumption
(ELSEVIER, 2020)Due to its practical relevance, the hybrid flowshop scheduling problem (HFSP) has been widely studied in the literature with the objectives related to production efficiency. However, studies regarding energy consumption ... -
Ensemble of metaheuristics for energy-efficient hybrid flowshops: Makespan versus total energy consumption
(Swarm and Evolutionary Computation, 2020)Due to its practical relevance, the hybrid flowshop scheduling problem (HFSP) has been widely studied in the literature with the objectives related to production efficiency. However, studies regarding energy consumption ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
