Academic open shop
β Scribed by Anderson, Alun
- Book ID
- 109737539
- Publisher
- Nature Publishing Group
- Year
- 1984
- Tongue
- English
- Weight
- 139 KB
- Volume
- 312
- Category
- Article
- ISSN
- 0028-0836
- DOI
- 10.1038/312687b0
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In his small noodle shop in Te Whanganui-a-Tara, a young chef obsessively juliennes carrots. Nothing is going according to plan: the bills are piling up, his mother is dead, and there are strangers in his kitchen. The ancestors are watching closely.Told through a series of brilliant interludes and j
## The objective of this paper is to develop polynomial algorithms for the open shop makespan problem. It is shown that when a machine majorizes all other machines and the ith largest processing time on that machine is at least as large as the processing times of all operations on machines i throu
Only few exact solution methods are available for the open shop scheduling problem. We describe a branch-and-bound algorithm for solving this problem which performs better than other existing algorithms. The key to the e ciency of our algorithm lies in the following approach: instead of analysing an