The Resource Agent-based heuristics to solve NP-hard scheduling problems, by Vincent Oakley

Agent-based heuristics to solve NP-hard scheduling problems, by Vincent Oakley

Label
Agent-based heuristics to solve NP-hard scheduling problems
Title
Agent-based heuristics to solve NP-hard scheduling problems
Statement of responsibility
by Vincent Oakley
Creator
Contributor
Subject
Language
eng
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%
Cataloging source
VDU
Dewey number
658.533
Dissertation note
Thesis (Ph.D.)--Deakin University, Victoria, 2007
Index
no index present
Literary form
non fiction
Nature of contents
  • bibliography
  • theses
Label
Agent-based heuristics to solve NP-hard scheduling problems, by Vincent Oakley
Publication
Note
Submitted to the School of Engineering and Information Technology of the Faculty of Science and Technology, Deakin University
Bibliography note
Includes bibliographical references (leaves 125-128)
http://library.link/vocab/branchCode
  • glgt
Control code
000042116175
Dimensions
30 cm
Extent
x, 128 leaves
http://library.link/vocab/recordID
.b22822409
System control number
  • dm42116175
  • (OCoLC)225347676

Library Locations

    • Deakin University Library - Geelong Waurn Ponds CampusBorrow it
      75 Pigdons Road, Waurn Ponds, Victoria, 3216, AU
      -38.195656 144.304955
Processing Feedback ...