Advances in Management and Applied Economics

On a Two-machine Flow-shop Scheduling Problem with a Single Server and Unit Processing Times

• [ Download ]
• Times downloaded: 10934

• Abstract

  We consider the problem of two-machine flow-shop scheduling with a single server and unit processing times, and show that this problem is NP -hard in the strong sense.