An improved discrete artificial bee colony algorithm for flexible flowshop scheduling with step deteriorating jobs and sequence-dependent setup times
From MaRDI portal
Publication:2298888
DOI10.1155/2019/8520503zbMath1435.90075OpenAlexW2994904763WikidataQ113268376 ScholiaQ113268376MaRDI QIDQ2298888
Publication date: 20 February 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2019/8520503
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Single-machine bicriterion group scheduling with deteriorating setup times and job processing times
- Multiprocessor task scheduling in multistage hybrid flowshops: a hybrid artificial bee colony algorithm with bi-directional planning
- A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
- Scheduling Deteriorating Jobs on a Single Processor
- A Two-Stage Flexible Flowshop Problem with Deterioration
- Single machine scheduling with step-deteriorating processing times
This page was built for publication: An improved discrete artificial bee colony algorithm for flexible flowshop scheduling with step deteriorating jobs and sequence-dependent setup times
