منابع مشابه
1 Lagrangian Relaxation Neural Networks for Job Shop Scheduling
Manufacturing scheduling is an important but difficult task. Building on our previous success in developing optimization-based scheduling methods using Lagrangian relaxation for practical applications, this paper presents a novel Lagrangian relaxation neural network (LRNN) optimization techniques. The convergence of LRNN for separable convex programming problems is established. For separable in...
متن کاملScaling properties of neural networks for job-shop scheduling
This paper investigates the scaling properties of neural networks for solving job-shop scheduling problems. Specifically, the Tank-Hopfield linear programming network is modified to solve mixed integer linear programming with the addition of step-function amplifiers. Using a linear energy function, our approach avoids the traditional problems associated with most Hopfield networks using quadrat...
متن کاملLagrangian Relaxation Neural Networks for Job Shop Scheduling
Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangian relaxation neural network (LRNN) for separable optimization problems by combining recurrent neural network optimization ideas with Lagrangian relaxation (LR) for constraint handling. The convergence of the network is proved, ...
متن کاملArchitectural Design of Neural Network Hardware for Job Shop Scheduling
By combining neural network optimization ideas with “Lagrangian relaxation” for constraint handling, a novel Lagrangian relaxation neural network (LRNN) has recently been developed for job shop scheduling. This paper is to explore architectural design issues for the hardware implementation of such neural networks. A digital circuitry with a micro-controller and an optimization chip is designed,...
متن کاملJob-shop scheduling
The n×m minimum-makespan general job-shop scheduling problem, hereafter referred to as the JSSP, can be described by a set of n jobs {Ji}1≤j≤n which is to be processed on a set of m machines {Mr}1≤r≤m. Each job has a technological sequence of machines to be processed. The processing of job Jj on machine Mr is called the operation Ojr. Operation Ojr requires the exclusive use of Mr for an uninte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Control Engineering Practice
سال: 1994
ISSN: 0967-0661
DOI: 10.1016/0967-0661(94)90571-1