Sorting with objectives. Graph theoretic concepts in industrial optimization

MaRDI QIDQ3086024zbMATH OpenFDO

Authors Felix G. König

Publication date 29 March 2011

Full work available at URL http://opus.kobv.de/tuberlin/volltexte/2010/2528/

Mathematics Subject Classification ID

Applications of graph theory (05C90) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Applications of mathematical programming (90C90)

Recommendations

• Integrated sequencing and scheduling in coil coating
• Models and algorithms for shuffling problems in steel plants
• Modelling and a segmented dynamic programming-based heuristic approach for the slab stack shuffling problem
• Simultaneously scheduling multiple turns for steel color-coating production
• An effective heuristic algorithm to minimise stack shuffles in selecting steel slabs from the slab yard for heating and rolling

Cited in

(6)

• The maximum clique problem in multiple interval graphs
• Integrated sequencing and scheduling in coil coating
• Models and algorithms for shuffling problems in steel plants
• Structural and extremal properties of the hot rolling batches precedence graph
• Sorting with line storage systems
• Temporal interval cliques and independent sets

This page was built for publication: Sorting with objectives. Graph theoretic concepts in industrial optimization

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