DYNAMIC SCHEDULING APPROACHES TO SOLVE SINGLE MACHINE PROBLEMS

摘要

In static scheduling problems it is assumed that jobs are ready at zero time or before processing begins. In dynamic scheduling problems a job can arrive at any instant in the interval time between zero and a limit established by its processing time, ensuring its accomplishment before the due date/deadline. In the cases where the arrivals are near zero the problem comes closer to the static one. Otherwise the problem becomes more restrictive. This paper describes the implementation details and the performance for two approaches to solve total dynamic problems for the single machine environments.