In this paper, a relatively new algorithm inspired by the viral replication system called Viral Systems is used to solve the Single-Machine Total Weighted Tardiness (SMTWTP). SMTWTP is a job scheduling problem which is one of classical combinatorial problems known as np-hard problems. This algorithm makes the process of finding solutions through neighborhood and mutation mechanism. The experiment was conducted to evaluate its performance. There are seven parameters which are required to tune in to find best solution. The experiment was implemented on data sets of 40 jobs, 50 jobs, and 100 jobs. The results show that the algorithm can solve 235 optimally out of 275 problems.

Original languageEnglish
Article number012010
JournalIOP Conference Series: Materials Science and Engineering
Issue number1
Publication statusPublished - 2013
Event2013 International Conference on Manufacturing, Optimization, Industrial and Material Engineering, MOIME 2013 - Bandung, Indonesia
Duration: 9 Mar 201310 Mar 2013


  • Metaheuristics
  • Single-Machine Total Weighted Tardiness Problem
  • Viral Systems
  • combinatorial problem


Dive into the research topics of 'Application of viral systems for single-machine total weighted tardiness problem'. Together they form a unique fingerprint.

Cite this