Time indexed formulation of scheduling problems
In this thesis, we study various approaches that could be used in finding a lower bound for single and parallel machine scheduling problems. These approaches are based on integer programming formulations involving binary variables indexed by (i,t), where i denotes a job and t is a time period. F...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
2009
|
| Online Access: | http://hdl.handle.net/2429/5850 |