A two-stage three-machine flow shop assembly problem mixed with a controllable number and sum-of-processing times-based learning effect by simulated annealing algorithms
From MaRDI portal
Publication:2213408
DOI10.1155/2020/4085718zbMath1459.90102OpenAlexW3092116465MaRDI QIDQ2213408
Publication date: 1 December 2020
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/4085718
Cites Work
- Single-machine and two-machine flowshop scheduling with general learning functions
- Single-machine scheduling with learning considerations
- Re-entrant flowshop scheduling with learning considerations to minimize the makespan
- Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect
- A state-of-the-art review on scheduling with learning effects
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- A bi-criteria two-machine flowshop scheduling problem with a learning effect
- Flow-shop scheduling with a learning effect
- A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion
- A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration
This page was built for publication: A two-stage three-machine flow shop assembly problem mixed with a controllable number and sum-of-processing times-based learning effect by simulated annealing algorithms
