We consider the open shop, job shop, and flow shop scheduling problems with integral processing times. We give polynomial-time algorithms to determine if an instance has a schedule of length at most 3, and show that deciding if there is a schedule of length at most 4 is 𝒩𝒫-complete. The latter res...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!