You are not logged in.

Agent-based heuristics to solve NP-hard scheduling problems

Oakley, Vincent. 2007, Agent-based heuristics to solve NP-hard scheduling problems, Ph.D. thesis, School of Engineering and Information Technology, Deakin University.

Title Agent-based heuristics to solve NP-hard scheduling problems
Author Oakley, Vincent.
Institution Deakin University
School School of Engineering and Information Technology
Faculty Faculty of Science and Technology
Degree name Ph.D.
Date submitted 2007
Keyword(s) Production scheduling - Data processing
Intelligent control systems
Summary A novel agent-driven heuristic approach was developed to control the operational scheduling for a local manufacturer. This approach outperformed the traditional kanban control mechanism under numerous simulated benchmarking tests. Using this approach, the individual machine loading was reduced by, on average, 28%, with the loading spread reduced by 85%
Language eng
Description of original x, 128 leaves ; 30 cm.
Dewey Decimal Classification 658.533
Persistent URL

Connect to link resolver
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 0 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 357 Abstract Views  -  Detailed Statistics
Created: Thu, 01 Apr 2010, 15:53:51 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact