Now showing items 11-12 of 12
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 ...