The solution of the concurrent layout scheduling problem in the job-shop environment through a local neighborhood search algorithm
作者：
Highlights：
• A local-neighborhood search algorithm solves concurrent layout and scheduling (CLSPJE) problems.
• Unfeasible schedules are avoided using a permutation codification.
• Mutation and local search operators are combined in the neighborhood structure of the algorithm.
• Optimization of CLSPJE problems is achieved with satisfactory results.
摘要
•A local-neighborhood search algorithm solves concurrent layout and scheduling (CLSPJE) problems.•Unfeasible schedules are avoided using a permutation codification.•Mutation and local search operators are combined in the neighborhood structure of the algorithm.•Optimization of CLSPJE problems is achieved with satisfactory results.
论文关键词：Job-shop scheduling problem,Facility layout problem,Local neighborhood search algorithm
论文评审过程：Received 29 May 2019, Revised 18 November 2019, Accepted 19 November 2019, Available online 20 November 2019, Version of Record 26 November 2019.
论文官网地址：https://doi.org/10.1016/j.eswa.2019.113096
