On the robustness of using balanced part mix ratios to determine cyclic part input sequences into flexible flow systems

DOI10.1080/00207549608905066zbMath0924.90088MaRDI QIDQ4230279

No author found.

Publication date: 1 March 1999

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/36120

zbMATH Keywords

robustness; simulation model; flexible flow system; minimal part set

Mathematics Subject Classification ID

90B30: Production models

Related Items

An AGV routing policy reflecting the current and future state of semiconductor and LCD production lines, Two-stage heuristic algorithms for part input sequencing in flexible manufacturing systems, A nonlinear goal programming model for multistage, multiobjective decision problems with application to grouping and loading problems in a flexible manufacturing system, A dynamic heuristic-based algorithm to part input sequencing in flexible manufacturing systems for mass customization capability, The optimality of balancing workloads in certain types of flexible manufacturing systems, Reducing work-in-process inventory in certain classes of flexible manufacturing systems, Analytical loading models in flexible manufacturing systems, Queueing network modelling of flexible manufacturing system using mean value analysis

Cites Work

• Scheduling batches on parallel machines with major and minor set-ups
• Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues
• A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
• Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems
• The Optimality of Unbalancing Both Workloads and Machine Group Sizes in Closed Queueing Networks of Multiserver Queues
• Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• On the Optimal Allocation of Servers and Workloads in Closed Queueing Networks