An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times

DOI10.1023/A:1009691028143zbMath0948.90071OpenAlexW1525607884MaRDI QIDQ1806709

Roger Z. Ríos-Mercado, Jonathan F. Bard

Publication date: 20 December 1999

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009691028143

zbMATH Keywords

traveling salesman problemheuristicsequence-dependent setup timesflow shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Scheduling flexible flow lines with sequence-dependent setup times, Modeling and solving the flow-shop scheduling problem with sequence-dependent setup times by firefly algorithm (case study: automotive industry), Exact algorithms for the vertex separator problem in graphs, A survey of scheduling problems with setup times or costs, An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives, Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times, Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics, Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup, Unnamed Item, A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times, A review of TSP based approaches for flowshop scheduling