A problem space algorithm for single machine weighted tardiness problems
Aktürk, M. S.
Storer, R. H.
IIE Transactions (Institute of Industrial Engineers)
Taylor & Francis Inc.
479 - 486
Item Usage Stats
We propose a problem space genetic algorithm to solve single machine total weighted tardiness scheduling problems. The proposed algorithm utilizes global and time-dependent local dominance rules to improve the neighborhood structure of the search space. They are also a powerful exploitation (intensifying) tool since the global optimum is one of the local optimum solutions. Furthermore, the problem space search method significantly enhances the exploration (diversification) capability of the genetic algorithm. In summary, we can improve both solution quality and robustness over the other local search algorithms reported in the literature.
Time and motion study
Problem space search method
Single machine weighted tardiness problem
Published Version (Please cite this version)http://dx.doi.org/10.1080/07408170304390
Showing items related by title, author, creator and subject.
How content management problem of a remote laboratory system can be handled by integrating an open source learning management system? Problems and solutions Özdoğru, Burcu; Cagıltay, N. E. (IEEE, 2007)This paper represents the design and implementation of the integration process of an open source learning management system (LMS) to the remote laboratory platform. The reason of using a learning management system is to ...
Yaman H.; Elloumi, S. (2012)We consider two problems that arise in designing two-level star networks taking into account service quality considerations. Given a set of nodes with pairwise traffic demand and a central hub, we select p hubs and connect ...
Erdoǧan, G.; Tansel, B. Ç. (Elsevier, 2011)The Quadratic Assignment Problem is one of the hardest combinatorial optimization problems known. We present two new classes of instances of the Quadratic Assignment Problem that can be reduced to the Linear Assignment ...