Adapting exact and heuristic procedures in solving an NP-hard sequencing problem

DOI10.1007/978-3-319-28697-6_85zbMATH Open1342.90030OpenAlexW2461604049MaRDI QIDQ2807019FDOQ2807019

Authors: Andreas Wiehl 

Publication date: 19 May 2016

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28697-6_85

Recommendations

• Minimizing delays in a shunting yard
• A note on ``Multistage methods for freight train classification
• Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals
• Storage Yard Management: Modelling and Solving
• The basic train makeup problem in shunting yards

zbMATH Keywords

CPLEX optimizer

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Cites Work

• Multistage methods for freight train classification

Cited In (2)

• NP-completeness of some optimal sequencing problems with a given grouping of elements
• Title not available (Why is that?)

Uses Software

• CPLEX

This page was built for publication: Adapting exact and heuristic procedures in solving an NP-hard sequencing problem

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