A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system
From MaRDI portal
Publication:2052988
DOI10.1007/s10100-020-00701-wOpenAlexW3048943261MaRDI QIDQ2052988
Raúl Pino, Rafael Rosillo, Nicolás Álvarez-Gil, David de la Fuente
Publication date: 29 November 2021
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-020-00701-w
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel machines scheduling with nonsimultaneous machine available time
- An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
- Single-machine scheduling with learning considerations
- A branch and bound algorithm for the job-shop scheduling problem
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- A hierarchical approach for the FMS scheduling problem
- Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
- Effective neighbourhood functions for the flexible job shop problem
- The hybrid flow shop scheduling problem
- Routing and scheduling in a flexible job shop by tabu search
- A genetic algorithm for the flexible job-shop scheduling problem
- A hybrid genetic algorithm for the job shop scheduling problem
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Firefly Algorithms for Multimodal Optimization
- A Review of Production Scheduling
- The Complexity of Flowshop and Jobshop Scheduling
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
