scientific article

zbMATH Open1183.90174MaRDI QIDQ3641981FDOQ3641981

Xingsan Qian, Guochun Tang, Caixia Jing

Publication date: 11 November 2009

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

zbMATH Keywords

computational complexityschedulingpolynomial algorithmsetup timemulti-purpose machine

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (2)

• On the complexity of two machine job-shop scheduling with regular objective functions
• Complexity of scheduling problems with multi-purpose machines

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 Q3641981)