Search
Now showing items 1-10 of 12
Green Permutation Flowshop Scheduling: A Trade- off- Between Energy Consumption and Total Flow Time
(SPRINGER INTERNATIONAL PUBLISHING AG, 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 ...
An energy-efficient permutation flowshop scheduling problem
(PERGAMON-ELSEVIER SCIENCE LTD, 2020)
The permutation flowshop scheduling problem (PFSP) has been extensively explored in scheduling literature because it has many real-world industrial implementations. In some studies, multiple objectives related to production ...
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 ...
Metaheuristic algorithms for the hybrid flowshop scheduling problem
(PERGAMON-ELSEVIER SCIENCE LTD, 2019)
The hybrid flowshop scheduling problem (HFSP) has been widely studied in the literature, as it has many real-life applications in industry. Even though many solution approaches have been presented for the HFSP with makespan ...
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, ...
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 ...
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 ...
Metaheuristic algorithms for the hybrid flowshop scheduling problem
(Computers and Operations Research, 2019)
The hybrid flowshop scheduling problem (HFSP) has been widely studied in the literature, as it has many real-life applications in industry. Even though many solution approaches have been presented for the HFSP with makespan ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
