Firefly-Inspired Algorithm for Job Shop Scheduling

DOI10.1007/978-3-319-98355-4_24zbMath1514.68333OpenAlexW2887169425MaRDI QIDQ6163642

Unnamed Author, Unnamed Author, K. Steinhöfel

Publication date: 30 June 2023

Published in: Adventures Between Lower Bounds and Higher Altitudes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-98355-4_24

zbMATH Keywords

simulated annealingjob-shop schedulingfirefly algorithm

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The job shop scheduling problem: Conventional and new solution techniques
• Two simulated annealing-based heuristics for the job shop scheduling problem
• Benchmarks for basic scheduling problems
• Optimal two- and three-stage production schedules with setup times included
• Fifty years of scheduling: a survey of milestones
• On the power of randomization for job shop scheduling withk-units length tasks
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Job Shop Scheduling by Simulated Annealing
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• A Computational Study of the Job-Shop Scheduling Problem
• Job Shop Scheduling by Local Search
• Scheduling

This page was built for publication: Firefly-Inspired Algorithm for Job Shop Scheduling