An Improved Augmented Neural-Network Approach for Scheduling Problems

Authors:
Anurag Agarwal;Varghese S. Jacob;Hasan Pirkul
Affiliations:
Department of Decision and Information Sciences, Warrington College of Business Administration, University of Florida, Gainesville, Florida 32611-7169, USA;School of Management, University of Texas at Dallas, Richardson, Texas 75083-0688, USA;School of Management, University of Texas at Dallas, Richardson, Texas 75083-0688, USA
Venue:
INFORMS Journal on Computing
Year:
2006

Citing 5
Cited 2

Multiple job scheduling with artificial neural networks

Computers and Electrical Engineering - Special issue on artificial intelligence in engineering design and manufacturing
A comparison of list schedules for parallel processing systems

Communications of the ACM
A Hybrid Genetic Algorithm for the Single Machine Scheduling Problem

Journal of Heuristics
A taxonomy of scheduling in general-purpose distributed computing systems

IEEE Transactions on Software Engineering
Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing

IEEE Transactions on Computers

Mathematical model and genetic optimization for the job shop scheduling problem in a mixed- and multi-product assembly environment: a case study based on the apparel industry

Computers and Industrial Engineering
Hybrid genetic algorithm and augmented neural network application for solving the online advertisement scheduling problem with contextual targeting

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the task-scheduling problem, we propose an augmented neural-network approach, which allows the integration of greedy as well as nongreedy heuristics (AugNN-GNG), to give improved solutions in a small number of iterations. The problem we address is that of minimizing the makespan of n tasks on m identical machines (or processors), where tasks are nonpreemptive and follow a precedence order. The proposed approach exploits the observation that a nongreedy search heuristic often finds better solutions than do their greedy counterparts. We hypothesize that combinations of nongreedy and greedy heuristics when integrated with an augmented neural-network approach can lead to better solutions than can either one alone. We show the formulation of such integration and provide empirical results on over a thousand problems. This approach is found to be very robust in that the results were not very sensitive to the type of greedy heuristic chosen. The new approach is able to find solutions, on average, within 1.8 to 2.8 of the lower bound compared to 2.0 to 8.3 for the greedy-only AugNN approach. This improvement is obtained without any increase in computational complexity. In fact the number of iterations used to find the solution decreased.