Efficient heuristic algorithm for scheduling two-stage hybrid flowshop with sequence-dependent setup times

DOI10.1155/2015/420308zbMath1394.90284OpenAlexW1549025930WikidataQ59118529 ScholiaQ59118529MaRDI QIDQ1665637

Seong-Hoon Choi, Jung Man Hong, Geun-Cheol Lee

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping ⋮ A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time

Cites Work

• Optimization by Simulated Annealing
• An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
• Johnson's rule, composite jobs and the relocation problem
• Scheduling flexible flow lines with sequence-dependent setup times
• The hybrid flow shop scheduling problem
• Optimal two- and three-stage production schedules with setup times included
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Two-Stage, Hybrid Flowshop Scheduling Problem

This page was built for publication: Efficient heuristic algorithm for scheduling two-stage hybrid flowshop with sequence-dependent setup times