《2016 An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem》.pdf

European Journal of Operational Research 200 (2010) 395–408 Contents lists available at ScienceDirect European Journal of Operational Research journal homepage: www.else /locate/ejor Production, Manufacturing and Logistics An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem L. De Giovanni a,*, F. Pezzella b a Dipartimento di Matematica Pura ed Applicata, Università degli studi di Padova, via Trieste, 63, 35121 Padova, Italy b Dipartimento di Ingegneria Informatica, Gestionale e dell’Automazione, Università Politecnica delle Marche, via Brecce Bianche, 60131 Ancona, Italy a r t i c l e i n f o a b s t r a c t Article history: The Distributed and Flexible Job-shop Scheduling problem (DFJS) considers the scheduling of distributed Received 25 July 2007 manufacturing environments, where jobs are processed by a system of several Flexible Manufacturing Accepted 2 January 2009 Units (FMUs). Distributed scheduling problems deal with the assignment of jobs to FMUs and with deter- Available online 14 January 2009 mining the scheduling of each FMU, in terms of assignment of each job operation to one of the machines able to work it (job-routing flexibility) and sequence of operations on each machine. The objective is to Keywords: minimize the global makespan over all the FMUs. This paper proposes an Improved Genetic Algorithm to Genetic Algorithms solve the Distributed and Flexible