Minimization of open orders using interval graphs

MaRDI QIDQ3107598zbMATH OpenFDO

Authors Isabel Cristina Lopes, José Valério de Carvalho

Publication date 24 December 2011

zbMATH Keywords

integer programminginterval graphs

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Transportation, logistics and supply chain management (90B06) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• Minimum flow time graph ordering.
• Connections between cutting-pattern sequencing, VLSI design, and flexible machines
• Refinements on an enumeration scheme for solving a pattern sequencing problem
• On a setup optimization problem for interval orders
• scientific article; zbMATH DE number 894720

Cited in

(4)

• The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
• Connections between cutting-pattern sequencing, VLSI design, and flexible machines
• Refinements on an enumeration scheme for solving a pattern sequencing problem
• Mathematical models for the one-dimensional cutting stock problem with setups and open stacks

This page was built for publication: Minimization of open orders using interval graphs

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