Search

This paper presents the identical parallel machine’s scheduling problem when the jobs are submitted over time. This problem consists of assigning N various jobs to M identical parallel machines to reduce the workload imponderables among the different machines. We generalized the mixed-integer linear programming approach to decrease the workload imbalance between the different machines, and that is done by converting the problem to the mathematical model. The studied cases are presented for different problems, and it indicates to an online system, and this system does not know the arrival times of the jobs before and reduce Makespan criterion is not well appropriate to describe the utilization for this online problem. The obtained results proved good solutions for the scheduling problem compared with standard algorithms.