Hochbaum and Shmoys presented a polynomial-time approximation scheme in 1987 that finds an approximate solution to the offline makespan minimisation problem with atomic jobs to any desired degree of accuracy.
Pet Shop Boys | Little Shop of Horrors | Little Shop of Horrors (musical) | The Body Shop | The Italian Job | Future Shop | Little Shop | Job | Book of Job | Job Cohen | Odd Job Jack | The Shop Girl | The Old Curiosity Shop | The Little Shop of Horrors | Stop & Shop | Our Favourite Shop | Automobile repair shop | coffee shop | The 1st Shop of Coffee Prince | Shop 'n Save | Scheduling (computing) | scheduling | record shop | Macarthur Job | Little Shop of Horrors (film) | La Job | Job Corps | Dream Job | V. C. Morris Gift Shop | Top Shop |