scientific article; zbMATH DE number 176473

zbMATH Open0765.90057MaRDI QIDQ4035635FDOQ4035635

Authors: Eugene L. Lawler 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
• scientific article; zbMATH DE number 3894817
• Sequencing with ordered criteria, precedence and group technology constraints
• scientific article; zbMATH DE number 3850790
• scientific article; zbMATH DE number 5605136

zbMATH Keywords

preference orderratio ruleoptimal sequencingcontiguity constraintsunconstrained weighted completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Cited In (2)

• The number of preference orderings: a recursive approach
• Optimal Sequencing by Modular Decomposition: Polynomial Algorithms

This page was built for publication:

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