Bio-Soft Computational and Tabu Search Methods for Solving a Multi-Task Project Scheduling Problem

Kim, Ikno; Watada, Junzo
April 2012
Journal of Computers;Apr2012, Vol. 7 Issue 4, p1055
Academic Journal
This article presents a novel integrated method in which bio-soft computational and tabu search methods are both used to solve a multi-task project scheduling problem. In this scheduling problem, the main challenge is to determine the most reliable completion time. To solve this problem, we first use our proposed bio-soft computational method. Next, a tabu search method is used to verify the final results of the bio-soft computational method. The biosoft computational method includes molecular techniques, and the tabu search method is an intelligent optimization technique. Based upon this integrated method's success solving a multi-task project scheduling problem, this article proposes that this method can help decision makers in their computational project scheduling.


Related Articles

  • An analysis of empirical testing for modal decision procedures. Horrocks, I; Patel-Schneider, PF; Sebastiani, R // Logic Journal of the IGPL;2000, Vol. 8 Issue 3, p293 

    Recent years have seen the emergence of a new generation of heavily-optimised modal decision procedures. Several systems based on such procedures are now available and have proved to be much more effective than the previous generation of modal decision procedures. As both computational...

  • Committees of Systems of Linear Inequalities. Mazurov, V. D.; Khachai, M. Yu. // Automation & Remote Control;Feb2004, Vol. 65 Issue 2, p193 

    The conceptual issues of the theory of committee decision rules were considered, and its close relationship with the theory of substantiation of collective decision making and teaching neural networks was demonstrated. The problem of the minimum committee of an incompatible system of...

  • Game Theory for Wireless Sensor Networks: A Survey. Shi, Hai-Yan; Wang, Wan-Liang; Kwok, Ngai-Ming; Chen, Sheng-Yong // Sensors (14248220);2012, Vol. 12 Issue 7, p9055 

    Game theory (GT) is a mathematical method that describes the phenomenon of conflict and cooperation between intelligent rational decision-makers. In particular, the theory has been proven very useful in the design of wireless sensor networks (WSNs). This article surveys the recent developments...

  • A Three-Stage Optimization Algorithm for the Stochastic Parallel Machine Scheduling Problem with Adjustable Production Rates. Rui Zhang // Discrete Dynamics in Nature & Society;2013, p1 

    We consider a parallel machine scheduling problem with random processing/setup times and adjustable production rates. The objective functions to be minimized consist of two parts; the first part is related with the due date performance (i.e., the tardiness of the jobs), while the second part is...

  • Configuration, Deployment, and Scheduling Models for Management and Optimization of Patrol Services. Yang, Bin; Hu, Zhi-Hua; Zhou, Jing-Xian // Mathematical Problems in Engineering;8/26/2015, Vol. 2015, p1 

    This paper presents a decision support system (DSS) and its models for patrol service center (PSC). PSC plays an important role in public security and emergency management. The configuration, deployment, and scheduling of resources of PSC are important for improving the efficiency of...

  • Competitive Two-Agent Scheduling with Learning Effect and Release Times on a Single Machine. Der-Chiang Li; Peng-Hsiang Hsu // Mathematical Problems in Engineering;2013, p1 

    The learning effect has gained much attention in the scheduling research recently, where many researchers have focused their problems on only one optimization. This study further addresses the scheduling problem in which two agents compete to perform their own jobs with release times on a common...

  • On bilevel machine scheduling problems. Kis, Tamás; Kovács, András // OR Spectrum;Jan2012, Vol. 34 Issue 1, p43 

    Bilevel scheduling problems constitute a hardly studied area of scheduling theory. In this paper, we summarise the basic concepts of bilevel optimisation, and discuss two problem classes for which we establish various complexity and algorithmic results. The first one is the bilevel total...

  • Counting and enumeration complexity with application to multicriteria scheduling. T'kindt, Vincent; Bouibede-Hocine, Karima; Esswein, Carl // Annals of Operations Research;Sep2007, Vol. 153 Issue 1, p215 

    In this paper we tackle an important point of combinatorial optimisation: that of complexity theory when dealing with the counting or enumeration of optimal solutions. Complexity theory has been initially designed for decision problems and evolved over the years, for instance, to tackle...

  • THE COMPLEXITY OF DECENTRALIZED CONTROL OF MARKOV DECISION PROCESSES. Bernstein, Daniel S.; Givan, Robert; Immerman, Neil; Zilberstein, Shlomo // Mathematics of Operations Research;Nov2002, Vol. 27 Issue 4, p819 

    We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalizations of both the fully observable case and the partially observable case that allow for decentralized control are...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics