Multi-objective two-stage multiprocessor flow shop scheduling – a subgroup particle swarm optimisation approach
From MaRDI portal
Publication:2792241
DOI10.1080/00207721.2014.886742zbMath1332.90103OpenAlexW1974438947MaRDI QIDQ2792241
Chang-Lin Yang, Chun-Ting Hsu, Rong-Hwa Huang
Publication date: 8 March 2016
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207721.2014.886742
Related Items (1)
Cites Work
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Optimal scheduling of a two-stage hybrid flow shop
- A hybrid simplex search and particle swarm optimization for unconstrained optimization
- A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
- Hybrid flow-shop scheduling problems with multiprocessor task systems.
- A local and global search combine particle swarm optimization algorithm for job-shop scheduling to minimize makespan
- A truck scheduling problem arising in intermodal container transportation
- Two-Stage, Hybrid Flowshop Scheduling Problem
- Parallel machine scheduling with common due windows
- A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem
This page was built for publication: Multi-objective two-stage multiprocessor flow shop scheduling – a subgroup particle swarm optimisation approach