Cellular control of manufacturing systems

Abstract The scope of this paper is twofold. Firstly we propose augmented Lagrangian-based decomposition techniques for solving scheduling problems in manufacturing systems and then we show that the resulting decomposition of the mathematical problem lends itself to control systems with a topological cellular structure, and that it can be espoused very naturally with an object-oriented programming approach.

[1]  G. Menga,et al.  G++: An Environment for Object-Oriented Design and Prototyping of Manufacturing Systems , 1993 .

[2]  C. Potts,et al.  Algorithms for two-machine flow-shop sequencing with precedence constraints , 1984 .

[3]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[4]  S. L. van de Velde,et al.  Machine scheduling and Lagrangian relaxation , 1991 .

[5]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[6]  Giuseppe Menga,et al.  Hybrid hierarchical scheduling and control systems in manufacturing , 1990, IEEE Trans. Robotics Autom..

[7]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[8]  C. Potts.  A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time , 1985 .

[9]  Krishna R. Pattipati,et al.  Schedule generation and reconfiguration for parallel machines , 1990, IEEE Trans. Robotics Autom..

[10]  R. Conterno,et al.  Order scheduling problem in manufacturing systems , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[11]  Chris N. Potts,et al.  An algorithm for single machine sequencing with release dates to minimize total weighted completion time , 1983, Discret. Appl. Math..

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Marshall L. Fisher,et al.  Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I , 1973, Oper. Res..

[14]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[15]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[16]  Grady Booch,et al.  Object-Oriented Design with Applications , 1990 .

[17]  Jacek Ba̵ażewicz,et al.  Solving the resource constrained deadline scheduling problem via reduction to the network flow problem , 1981 .

[18]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[19]  M. Bazaraa,et al.  A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality , 1979 .

[20]  Yu-Chi Ho,et al.  Ordering scheduling problem in manufacturing systems , 1988 .

[21]  S. L. Velde.  Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation , 1991 .

[22]  D.J. Hoitomt,et al.  Scheduling jobs with simple precedence constraints on parallel machines , 1990, IEEE Control Systems Magazine.

[23]  Kathryn E. Stecke,et al.  A Branch and Bound Approach for Machine Load Balancing in Flexible Manufacturing Systems , 1986 .

[24]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[25]  David K. Smith,et al.  Mathematical Programming: Theory and Algorithms , 1986 .

[26]  E. Max,et al.  Parallel machine scheduling using Lagrangian relaxation , 1988, [Proceedings] 1988 International Conference on Computer Integrated Manufacturing.

[27]  J. Shapiro.  A Survey of Lagrangian Techniques for Discrete Optimization. , 1979 .