Modeling and solving the flow-shop scheduling problem with sequence-dependent setup times by firefly algorithm (case study: automotive industry)
From MaRDI portal
Publication:2676023
DOI10.1155/2022/8962052zbMath1497.90095OpenAlexW4293199965MaRDI QIDQ2676023
Mohamadreza Lotfi, Seyed Ahmad Shayannia, Mustafa Mohammadi, Javad Rezaeian Zaidi
Publication date: 27 September 2022
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2022/8962052
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
- Scheduling a flowline manufacturing cell with sequence dependent family setup times
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times
- Multiobjective optimization for complex flexible job-shop scheduling problems
- A survey of scheduling problems with setup times or costs
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- A model for the time dependent vehicle routing problem with time windows under traffic conditions with intelligent travel times
This page was built for publication: Modeling and solving the flow-shop scheduling problem with sequence-dependent setup times by firefly algorithm (case study: automotive industry)
