Two-machine stochastic flow shops with blocking and the traveling salesman problem

DOI10.1007/s10951-005-4782-zzbMath1123.90028OpenAlexW2067213841MaRDI QIDQ880520

Pawel Jan Kalczynski, Jerzy Kamburowski

Publication date: 15 May 2007

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

Full work available at URL: https://doi.org/10.1007/s10951-005-4782-z

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices

Cites Work

• Unnamed Item
• Unnamed Item
• A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
• Minimizing variation in stochastic flow shop
• A contribution to the stochastic flow shop scheduling problem.
• Stochastically minimizing total flowtime in flowshops with no waiting space
• GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY
• Rearrangement, Majorization and Stochastic Scheduling
• Minimizing the Expected Makespan in Stochastic Flow Shops
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: Two-machine stochastic flow shops with blocking and the traveling salesman problem