1996-09-01
An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds
Publication
Publication
I N F O R M S Journal on Computing: charting new directions in OR and CS p. 376- 382
Presents an algorithm which determines the optimal permutations for all machine speeds in O(n log n) time where the algorithm n is the number of jobs. Description of the two-machine flow shop problem; Use of the algorithm as an elementary dominance relation; Description of the algorithm; Correctness of the algorithm.
| Additional Metadata | |
|---|---|
| , | |
| hdl.handle.net/1765/2304 | |
| I N F O R M S Journal on Computing: charting new directions in OR and CS | |
| Organisation | Erasmus School of Economics |
|
van Hoesel, C. P. M., Wagelmans, A., & van Vliet, M. (1996). An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds. I N F O R M S Journal on Computing: charting new directions in OR and CS, 376–382. Retrieved from http://hdl.handle.net/1765/2304 |
|
