Cellular control of manufacturing systems

DOI10.1016/0377-2217(93)90031-HMaRDI QIDQ1309976zbMATH OpenFDO

Authors M. Cavalotto, F. Della Croce, Giuseppe Menga, Roberto Tadei, Larissa A. Petri

Publication date 6 January 1994

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

object-oriented programmingaugmented Lagrangian-based decomposition techniques

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Recommendations

• scientific article; zbMATH DE number 1786162
• Cell control research— current status and development trends
• Optimal Flow Control for Continuous‐time Scheduling in Flexible Manufacturing Systems
• On-line scheduling in a multi-cell flexible manufacturing system
• Optimal flow control in manufacturing systems. Production planning and scheduling. Incl. 1 disk

Cites work

• scientific article; zbMATH DE number 3972625 (Why is no real title available?)
• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 49601 (Why is no real title available?)
• scientific article; zbMATH DE number 3542174 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• A Branch and Bound Approach for Machine Load Balancing in Flexible Manufacturing Systems
• A Computational Study of the Job-Shop Scheduling Problem
• A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time
• A Survey of Lagrangean Techniques for Discrete Optimization
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• Algorithms for two-machine flow-shop sequencing with precedence constraints
• An Algorithm for Solving the Job-Shop Problem
• An algorithm for single machine sequencing with release dates to minimize total weighted completion time
• Approximation algorithms for scheduling unrelated parallel machines
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
• Ordering scheduling problem in manufacturing systems
• Solving the resource constrained deadline scheduling problem via reduction to the network flow problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The Shifting Bottleneck Procedure for Job Shop Scheduling

Cited in

(6)

• An intelligent controller for manufacturing cells
• Aggregate planning and scheduling in the food industry: A case study
• An optimisation-oriented model of distributed supply-chain
• Manufacturing capability measurement for cellular manufacturing systems
• Management of product variety in cellular manufacturing systems
• Identifying the composition of a cellular manufacturing system

Describes a project that uses

Uses Software

• JOBSHOP

This page was built for publication: Cellular control of manufacturing systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309976)