Theoretical Mathematics & Applications

Scheduling a Three-machine Flow-shop Problem with a Single Server and Equal Processing Times

• [ Download ]
• Times downloaded: 10818

• Abstract

  We consider the problem of three-machine flow-shop scheduling with a single server and equal processing times, we show that this problem is NP -hard in the strong sense and present an improved Y - H algorithm for it with worst-case bound
  4 / 3.