Published October 28, 2026 | Version v1

Improved Workload Balancing of the Scheduling Jobs with the Release Dates in Identical Parallel Machines

Description

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.
 

Files

9619ijcsea01.pdf

Files (712.6 kB)

Name Size
md5:595c12f38736e02b29138c95b0fd8c53
712.6 kB Preview Download

Additional details

Related works

Dates

Copyrighted
2019

References

  • B. V. Raghavendra and A. N. N. Murthy. Some solution approaches to reduce the imbalance of workload in parallel machines while planning in flexible manufacturing system. International Journal of Engineering Science and Technology, 2(5), 2010.
  • B. V. Raghavendra and A. N. N. Murthy. Workload balancing in identical parallel machine scheduling while planning in flexible manufacturing system using genetic algorithm. ARPN Journal of Engineering and Applied Sciences, 6(1), 2011.
  • B. V. Raghavendra, A. N. N. Murthy, and M. Jayaram. Job sequence to minimize the workload imbalance on parallel machines through genetic algorithm. International Journal of Engineering Science and Technology, 3(1), 2011.
  • B. V. Raghavendra, A. N. N. Murthy, and N. B. Rao. Some solution approaches to reduce the imbalance of workload in parallel machines while planning in flexible manufacturing system through genetic algorithm. International Journal of Engineering Science and Technology, 2(1), 2010.
  • D. H. Moon, D. K. Kim, and J. Y. Jung. An operator load-balancing problem in a semi-automatic parallel machine shop. Computers and Industrial Engineering, 46(2):355–362, 2004.
  • E. Mokotoff. Parallel machine scheduling problems: A survey. Asia - Pacific Journal of Operational Research, 18:193 – 242, 2001.
  • I. Caragiannis. Better bounds for online load balancing on unrelated machines. In Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, SODA '08, pages 972–981, Philadelphia, PA, USA, 2008. Society for Industrial and Applied Mathematics.
  • J.C. Ho, T.L. Tseng, A.J. Ruiz-Torres, and F. J. L´opez. Minimizing the normalized sum of square for workload deviations on m parallel processors. Computers and Industriel Engineering., 56(1):186–192, 2009.
  • K. Heinrich. A heuristic algorithm for the loading problem in flexible manufacturing systems. International Journal of Flexible Manufacturing Systems, 7:229–254, 1995.
  • M.B. Yildirim, E. Duman, K. Krishna, and K. Senniappan. Parallel machine scheduling with load balancing and sequence dependent setups. International Journal of Operations Research, 4(1):42– 49, 2007.
  • M. Eid and U. Schwiegelshohn.Utilization of nonclairvoyant online schedules. Theoretical Computer Science 362: 238 – 247, 1-3(2006).