A setup heuristic for interval orders

DOI10.1016/0167-6377(85)90027-6zbMath0576.90097OpenAlexW2064889167MaRDI QIDQ1064975

Ulrich Faigle, Rainer Schrader

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0167-6377(85)90027-6

zbMATH Keywords

interval ordersgreedy heuristicsetup minimizationefficient approximate solution

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Management decision making, including multiple objectives (90B50) Individual preferences (91B08) Software, source code, etc. for problems pertaining to ordered structures (06-04)

Related Items (6)

Interval orders without odd crowns are defect optimal ⋮ The jump number problem on interval orders: A 3/2 approximation algorithm ⋮ The arboreal jump number of an order ⋮ A 3/2-approximation algorithm for the jump number of interval orders ⋮ The jump number of Z-free ordered sets ⋮ On a setup optimization problem for interval orders

Cites Work

• Optimal Linear Extensions by Interchanging Chains
• Algorithmic Approaches to Setup Minimization
• Scheduling Interval-Ordered Tasks
• The edge inducibility of graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: A setup heuristic for interval orders