The single machine early/tardy problem
Management Science
Sequencing with earliness and tardiness penalties: a review
Operations Research
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
Computers and Operations Research
Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review
Operations Research
Improved heuristics for the early/tardy scheduling problem with no idle time
Computers and Operations Research
Computers and Industrial Engineering
Computers and Industrial Engineering
Computers and Industrial Engineering
| Hi-index | 0.00 |
In this paper, we consider the single machine earliness/tardiness scheduling problem with job-independent penalties, and no machine idle time. Several dispatching heuristics are proposed, and their performance is analysed on a wide range of instances. The heuristics include simple scheduling rules, as well as a procedure that takes advantage of the strengths of each of those rules. We also consider early/tardy dispatching procedures, and a heuristic method based on existing adjacent precedence conditions. An improvement procedure that can be used to improve the schedules generated by the heuristics is also proposed. The computational tests show that the best results are given by the early/tardy dispatching rules. These heuristics are also quite fast, and are capable of quickly solving even very large instances. The use of the improvement procedure is recommended, since it improves the solution quality, with little additional computational effort.