Disjunctive graph based acyclic reconfigurable flow shop modeling and optimization

MaRDI QIDQ3412644zbMATH OpenFDO

Authors Sicheng Ren, De Xu, Fang Wang, Min Tan

Publication date 2 January 2007

Mathematics Subject Classification ID

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

Recommendations

• Timed event graph-based cyclic reconfigurable flow shop modelling and optimization
• Permutation-induced acyclic networks for the job shop scheduling problem
• The disjunctive graph machine representation of the job shop scheduling problem
• scientific article; zbMATH DE number 1859342
• Alternative graph formulation for solving complex factory-scheduling problems

Cited in

(1)

• Timed event graph-based cyclic reconfigurable flow shop modelling and optimization

This page was built for publication: Disjunctive graph based acyclic reconfigurable flow shop modeling and optimization

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