Given a set of identical parallel machines and a set of jobs with different due dates and release times, we consider the problem of finding a schedule such that the number of late jobs is minimized, where the given due dates and release times are assumed to be agreeable. A heuristic algorithm is presented and a dynamic programming lower bounding procedure is developed. Computational experiments are performed to show the effectiveness of the heuristic.
ASJC Scopus subject areas
- Computer Science(all)
- Management Science and Operations Research
- Modelling and Simulation
- Information Systems and Management
- Applied Mathematics