Search
Now showing items 1-4 of 4
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 ...
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 ...
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 ...