1996
A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time
Publication
Publication
I N F O R M S Journal on Computing: charting new directions in OR and CS p. 403- 412
Presents a branch-and-bound algorithm which is based upon many dominance rules and various lower bound approaches, including relaxation of the machine capacity, data manipulation and Lagrangian relaxation. Insertion of the idle time for a given sequence; Properties of the proposed lower bounds.
| Additional Metadata | |
|---|---|
| , | |
| hdl.handle.net/1765/12345 | |
| ERIM Article Series (EAS) | |
| I N F O R M S Journal on Computing: charting new directions in OR and CS | |
| Organisation | Erasmus Research Institute of Management |
|
Hoogeveen, H., & van de Velde, S. (1996). A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time. I N F O R M S Journal on Computing: charting new directions in OR and CS, 403–412. Retrieved from http://hdl.handle.net/1765/12345 |
|
