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

DOI10.1023/A:1009691028143zbMATH Open0948.90071OpenAlexW1525607884MaRDI QIDQ1806709FDOQ1806709

Authors: 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

Recommendations

• A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times
• Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
• Solving the flexible job shop scheduling problem with sequence-dependent setup times
• General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach
• Heuristics for the flow line problem with setup costs

zbMATH Keywords

heuristictraveling salesman problemflow shop schedulingsequence-dependent setup times

Mathematics Subject Classification ID

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

Cited In (11)

• Exact algorithms for the vertex separator problem in graphs
• Q-learning algorithm performance for M-machine, N-jobs flow shop scheduling problems to minimize makespan
• Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup
• 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
• Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
• A survey of scheduling problems with setup times or costs
• Modeling and solving the flow-shop scheduling problem with sequence-dependent setup times by firefly algorithm (case study: automotive industry)
• Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• Scheduling flexible flow lines with sequence-dependent setup times

This page was built for publication: An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806709)