Combinatorial optimization models for production scheduling in automated manufacturing systems
From MaRDI portal
Publication:1278813
DOI10.1016/S0377-2217(96)00388-8zbMath0923.90066MaRDI QIDQ1278813
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Combinatorial optimization (90C27)
Related Items
Resolution of a scheduling problem in a flowshop robotic cell, A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints, Cyclic scheduling in a robotic production line, Improved integer linear programming formulations for the job sequencing and tool switching problem, Improved heuristic algorithms for the job sequencing and tool switching problem, Tool-feeder partitions for module assignment in PCB assembly, Sequencing and scheduling in robotic cells: recent developments, The tool switching problem revisited, Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound., Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines, LAD models, trees, and an analog of the fundamental theorem of arithmetic, Meeting the Challenges of Optimized Memory Management in Embedded Vision Systems Using Operations Research, Storage management of items in two levels of availability, Berge-acyclic multilinear 0-1 optimization problems, Feasibility recovery for the unit-capacity constrained permutation problem, An algorithmic framework for tool switching problems with multiple objectives, Scheduling identical parallel machines with tooling constraints, The unit-capacity constrained permutation problem, Production planning problems in printed circuit board assembly, Scheduling with tool changes to minimize total completion time: Basic results and SPT performance, A simple and effective hybrid genetic search for the job sequencing and tool switching problem, The modular tool switching problem, Parallel machine scheduling with tool loading, Cyclic scheduling in 3-machine robotic flow shops, Scheduling multi-colour print jobs with sequence-dependent setup times, On a special case of the quadratic assignment problem with an application to storage-and-retrieval devices, Scheduling dual gripper robotic cell: one-unit cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling algorithms for flexible flowshops: Worst and average case performance
- A strongly competitive randomized paging algorithm
- Throughput rate optimization in the automated assembly of printed circuit boards
- Some no-wait shops scheduling problems: Complexity aspect
- New trends in machine scheduling
- Algorithms for sequencing robot activities in a robot-centered parallel- processor workcell
- Scheduling in robotic cells: Complexity and steady state analysis
- Order selection on a single machine with high set-up costs
- Dynamic sequencing of robot moves in a manufactoring cell
- Determining the optimal starting times in a cyclic schedule with a given route
- Min-cut clustering
- Scheduling with resource management in manufacturing systems
- Vehicle scheduling in two-cycle flexible manufacturing systems
- A column generation approach to job grouping for flexible manufacturing systems
- A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
- Performance of Coffman-Graham schedules in the presence of unit communication delays
- Parallel machine scheduling with a common server
- On the supermodular knapsack problem
- Scheduling a two-machine robotic cell: A solvable case
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
- Incidence matrices and interval graphs
- Nonlinear 0–1 programming: I. Linearization techniques
- A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
- OPTIMAL TOOL MODULE DESIGN PROBLEM FOR NC MACHINE TOOLS
- Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems
- Totally-Balanced and Greedy Matrices
- A Branch and Bound Approach for Machine Load Balancing in Flexible Manufacturing Systems
- Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
- Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants
- Modelling and solving an FMS part selection problem
- Generalized Assignment with Nonlinear Capacity Interaction
- Quadratic knapsack problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Block Angular Structures and the Loading Problem in Flexible Manufacturing Systems
- The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints
- ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
- Routing Printed Circuit Cards Through an Assembly Cell
- Polynomial Complete Consecutive Information Retrieval Problems
- Models for machine-part grouping in cellular manufacturing
- Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
- Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
- Cyclic Scheduling of Identical Parts in a Robotic Cell
- Scheduling in Robotic Cells: Heuristics and Cell Design
- Approximation algorithms for integer covering problems via greedy column generation
- Single-Facility Resource Allocation Under Capacity-Based Economies and Diseconomies of Scope
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Flow Management in Flexible Manufacturing Cells with Pipeline Operations
- Problem Decomposition and Data Reorganization by a Clustering Technique
