Efficient heuristic algorithm for scheduling two-stage hybrid flowshop with sequence-dependent setup times
DOI10.1155/2015/420308zbMATH Open1394.90284OpenAlexW1549025930WikidataQ59118529 ScholiaQ59118529MaRDI QIDQ1665637FDOQ1665637
Authors: Geun-Cheol Lee, Jung Man Hong, Seong-Hoon Choi 
Publication date: 27 August 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/420308
Recommendations
- Two-Stage, Hybrid Flowshop Scheduling Problem
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- Heuristic algorithms for the two-stage hybrid flowshop problem
- Algorithms for a realistic variant of flowshop scheduling
- Scheduling a two-stage hybrid flowshop with separable setup and removal times
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization by simulated annealing
- The hybrid flow shop scheduling problem
- Optimal two- and three-stage production schedules with set-up time included
- Johnson's rule, composite jobs and the relocation problem
- Two-Stage, Hybrid Flowshop Scheduling Problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Scheduling flexible flow lines with sequence-dependent setup times
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
Cited In (10)
- A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time
- Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- A computational study of heuristics for two-stage flexible flowshops
- Algorithms for a realistic variant of flowshop scheduling
- A data intensive heuristic approach to the two-stage streaming scheduling problem
- Advances in Neural Networks – ISNN 2005
- A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times
- Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times
- An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal
This page was built for publication: Efficient heuristic algorithm for scheduling two-stage hybrid flowshop with sequence-dependent setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1665637)
