Simple algorithms for gilmore-gomory's traveling salesman and related problems
From MaRDI portal
Publication:2464402
DOI10.1023/A:1026200209386zbMath1154.90498OpenAlexW1549127239MaRDI QIDQ2464402
Publication date: 20 December 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1026200209386
Related Items (11)
On no-wait and no-idle flow shops with makespan criterion ⋮ Solution algorithms for synchronous flow shop problems with two dominating machines ⋮ Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines ⋮ On Eulerian extensions and their application to no-wait flowshop scheduling ⋮ On Gilmore-Gomory's open question for the bottleneck TSP. ⋮ Minimizing the number of workers in a paced mixed-model assembly line ⋮ An approximation algorithm for a bottleneck traveling salesman problem ⋮ A two-machine no-wait flow shop problem with two competing agents ⋮ An optimization-based heuristic for the robotic cell problem ⋮ A review of TSP based approaches for flowshop scheduling ⋮ SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
This page was built for publication: Simple algorithms for gilmore-gomory's traveling salesman and related problems
