Tactically delayed versus non-delay scheduling: An experimental investigation
This paper compares tactically delayed scheduling to non-delay scheduling. While both of these types of schedules belong to the class of active schedules, tactically delayed schedules have the feature of introducing deliberate idle periods into the schedule. Non-delay schedules permit no such delays. To compare these scheduling methods, a number of sample single-machine problems are analyzed. For each problem, all possible non-delay and tactically delayed schedules are enumerated and the resulting tardiness of each schedule is recorded. Non-delay schedules are found to be considerably less numerous with lower total tardiness on average. Tactically delayed schedules appear to have better best case behavior than non-delay schedules. The results here allure further research into active scheduling methods.
- Dynamic non-preemptive single machine scheduling
- Performance analysis of active schedules in identical parallel machine
- Scheduling job shops with delays
- An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs
- On single-machine scheduling without intermediate delays
- A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
- Dynamic non-preemptive single machine scheduling
- Multiple train repositioning operations in a railyard network
- On-line two-machine open shop scheduling with time lags
- A note: minimizing maximum earliness on a proportionate flowshop
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
- Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
- On-line two-machine job shop scheduling with time lags
This page was built for publication: Tactically delayed versus non-delay scheduling: An experimental investigation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1068706)
