Cellular control of manufacturing systems
From MaRDI portal
Publication:1309976
DOI10.1016/0377-2217(93)90031-HzbMath0784.90034MaRDI QIDQ1309976
M. Cavalotto, Larissa A. Petri, Roberto Tadei, Giuseppe Menga, Frederico Della Croce
Publication date: 6 January 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
Aggregate planning and scheduling in the food industry: A case study ⋮ An optimisation-oriented model of distributed supply-chain
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Algorithms for two-machine flow-shop sequencing with precedence constraints
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
- Solving the resource constrained deadline scheduling problem via reduction to the network flow problem
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time
- A Branch and Bound Approach for Machine Load Balancing in Flexible Manufacturing Systems
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Ordering scheduling problem in manufacturing systems
- An Algorithm for Solving the Job-Shop Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- A Computational Study of the Job-Shop Scheduling Problem
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
- A Survey of Lagrangean Techniques for Discrete Optimization
