Article ID Journal Published Year Pages File Type
496431 Applied Soft Computing 2012 10 Pages PDF
Abstract
► We study a single-machine problem with two competing agents. ► The objective is to minimize the total tardiness from one agent given a bound of maximum tardiness from the other agent. ► Three genetic algorithms are proposed to obtain the near-optimal solutions.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science Applications
Preview
Genetic algorithms for a two-agent single-machine problem with release time
Authors
, , ,