We consider a single-machine scheduling problem with equal-sized jobs. The objective is to minimize the maximum weighted earliness-tardiness and due-date costs. We present an algorithm to solve this problem. Our algorithm makes use of bottleneck jobs and priority queues, and has a computational complexity of O (n4log n). This complexity is a significant improvement of the existing algorithm in the literature.
- Analysis of algorithms
- Due-date assignment
ASJC Scopus subject areas
- Information Systems and Management
- Management Science and Operations Research
- Applied Mathematics
- Modelling and Simulation