The computational complexities of two multi-purpose machines scheduling problem with setup times

zbMATH Open1183.90174MaRDI QIDQ3641981FDOQ3641981

Xingsan Qian, Guochun Tang, Caixia Jing

Publication date: 11 November 2009

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 (4)

• Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times
• The complexity of two-job shop problems with multi-purpose unrelated machines.
• On the complexity of two machine job-shop scheduling with regular objective functions
• Complexity of scheduling problems with multi-purpose machines

   Recommendations

• Complexity of scheduling problems with multi-purpose machines 👍 👎
• The complexity of two-job shop problems with multi-purpose unrelated machines. 👍 👎
• Scheduling with arranged multi-purpose machines 👍 👎
• Multi-machine scheduling problem with setup times 👍 👎
• Scheduling problem with multi-purpose parallel machines 👍 👎

This page was built for publication: The computational complexities of two multi-purpose machines scheduling problem with setup times

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