An Integrated Optimization and Knowledge - Based Job Shop Scheduling System
暂无分享,去创建一个
Abstract The complexity of the job shop scheduling problem has led some researchers away from the difficulties associated with optimization approaches. Instead, they have chosen to pursue knowledge-based techniques more capable of handling dynamic changes such as machine breakdowns and new jobs. This paper presents a synergetic combination of optimization and knowledge-based methods in a system of distributed architecture. The high level knowledge-based component schedules the operations of a job through a contract negotiation process with relevant work centers. A scheduling algorithm based on Lagrangian relaxation is adapted to schedule individual work centers. Work centers “bid” on operations and the knowledge-based components “ward” contracts for their completion. Methods to prevent distributed components from violating the decisions of others are considered. The tradeoff between obtaining a good schedule and meeting originally promised job delivery dates is also examined. The net result is an effective, informative, and flexible job shop scheduling system.
[1] Krishna R. Pattipati,et al. Schedule generation and reconfiguration for parallel machines , 1990, IEEE Trans. Robotics Autom..
[2] Randall Davis,et al. Negotiation as a Metaphor for Distributed Problem Solving , 1988, Artif. Intell..
[3] D.J. Hoitomt,et al. Scheduling jobs with simple precedence constraints on parallel machines , 1990, IEEE Control Systems Magazine.