Solving the distributed two machine flow-shop scheduling problem using differential evolution

Dempster, P. and Li, P. and Drake, J.H. (2017) Solving the distributed two machine flow-shop scheduling problem using differential evolution. In: Advances in Swarm Intelligence. Lecture Notes in Computer Science . Springer, Cham, pp. 449-457. ISBN 9783319618234

Full text not available from this repository.

Abstract

Flow-shop scheduling covers a class of widely studied optimisation problem which focus on optimally sequencing a set of jobs to be processed on a set of machines according to a given set of constraints. Recently, greater research attention has been given to distributed variants of this problem. Here we concentrate on the distributed two machine flow-shop scheduling problem (DTMFSP), a special case of classic two machine flow-shop scheduling, with the overall goal of minimising makespan. We apply Differential Evolution to solve the DTMFSP, presenting new best-known results for some benchmark instances from the literature. A comparison to previous approaches from the literature based on the Harmony Search algorithm is also given.

Item Type:
Contribution in Book/Report/Proceedings
Additional Information:
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-61824-1_49
ID Code:
133356
Deposited By:
Deposited On:
21 May 2019 12:30
Refereed?:
Yes
Published?:
Published
Last Modified:
23 Sep 2020 07:08