Scheduling independent tasks to reduce mean finishing time
Communications of the ACM
Dynamic programming algorithms for scheduling parallel machines with family setup times
Computers and Operations Research
Heuristic methods for the identical parallel machine flowtime problem with set-up times
Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Computers & Mathematics with Applications
Batch scheduling to minimize total completion time
Operations Research Letters
The complexity of scheduling job families about a common due date
Operations Research Letters
| Hi-index | 0.13 |
This paper studies the identical parallel machine scheduling problem with family set-up times and an objective of minimizing total weighted completion time (weighted flowtime). The family set-up time is incurred whenever there is a switch of processing from a job in one family to a job in another family. A heuristic is proposed in this paper for the problem. Computational results show that the proposed heuristic outperforms an existing heuristic, especially for large-sized problems, in terms of both solution quality and computation times. The improvement of solution quality is as high as 4.753% for six-machine problem and 7.822% for nine-machine problem, while the proposed heuristic runs three times faster than the existing one.