Cellular control of manufacturing systems
type: Item
instance of: scholarly article
title: Cellular control of manufacturing systems
zbMATH Open document ID: 0784.90034
DOI: 10.1016/0377-2217(93)90031-H
author: M. Cavalotto
author: F. Della Croce
author: Giuseppe Menga
author: Roberto Tadei
author: Larissa A. Petri
published in: European Journal of Operational Research
publication date: 1994-01-06T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 474821
zbMATH Keywords: augmented Lagrangian-based decomposition techniques
zbMATH Keywords: object-oriented programming
describes a project that uses: JOBSHOP
MaRDI profile type: Publication
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: A Computational Study of the Job-Shop Scheduling Problem
cites work: A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
cites work: A Branch and Bound Approach for Machine Load Balancing in Flexible Manufacturing Systems
cites work: Solving the resource constrained deadline scheduling problem via reduction to the network flow problem
cites work: An Algorithm for Solving the Job-Shop Problem
cites work: Ordering scheduling problem in manufacturing systems
cites work: Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Q4198056
cites work: Q4178782
cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time
cites work: Algorithms for two-machine flow-shop sequencing with precedence constraints
cites work: Q3995531
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: Q3738922
cites work: Q4117588
cites work: A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time
cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
cites work: A Survey of Lagrangean Techniques for Discrete Optimization
cites work: Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
cites work: Q3999415
description: scientific article; zbMATH DE number 474821