Abstract:
The properties of the earliest and maximally possible (latest) times for starting the execution of jobs in fixed length schedules are investigated. Mathematical models are constructed as linear programming problems with Boolean variables of dimension much lower than used before. Successive approximation method solutions are proposed.
Fulltext:
PDF file (1516 kB)