An Adaptable Scheduling Algorithm for Flexible Flow Lines
From MaRDI portal
Publication:3790926
DOI10.1287/opre.36.3.445zbMath0646.90039MaRDI QIDQ3790926
Publication date: 1988
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.36.3.445
makespan; heuristic; limited storage capacity; expediting; manufacturing line; loading of parts; minimize queueing; reactions to system dynamics
90C90: Applications of mathematical programming
90B35: Deterministic scheduling theory in operations research
90B30: Production models
90C39: Dynamic programming
Related Items
Scheduling flexible flow lines with no in-process buffers, Scheduling in dial-indexed production lines, Sequencing a hybrid two-stage flowshop with dedicated machines, FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors, Scheduling manufacturing systems for delayed product differentiation in agile manufacturing, Conceptual framework for lot-sizing and scheduling of flexible flow lines, Scheduling algorithms for flexible flowshops: Worst and average case performance, A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem, Branch and bound algorithm for the flow shop with multiple processors, Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints, An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, A taxonomy of flexible flow line scheduling procedures, Simple heuristics for scheduling with limited intermediate storage, A production planning problem in FMS, Capacitated lot-sizing with extensions: a review, Dense open-shop schedules with release times, A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers, Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint, A genetic algorithm for the proportionate multiprocessor open shop, A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines, Design of electronic assembly lines: An analytical framework and its application, Global lower bounds for flow shops with multiple processors, A hybrid two-stage flowshop with part family, batch production, major and minor set-ups, Performance of scheduling algorithms for no-wait flowshops with parallel machines, Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment, Minimizing makespan in hybrid flowshops, An aggregation procedure for simulating manufacturing flow line models, Workload planning in small lot printed circuit board assembly, A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage., A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities., The flow shop with parallel machines: A tabu search approach, Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines, Heuristics for scheduling in a flow shop with multiple processors, Scheduling flexible flow lines with sequence-dependent setup times, Three stage generalized flowshop: Scheduling civil engineering projects, A review of TSP based approaches for flowshop scheduling, An introduction of dominant genes in genetic algorithm for FMS, Analysis of partial setup strategies for solving the operational planning problem in parallel machine electronic assembly systems, The impact of lot sizing and sequencing on manufacturing performance in a two-stage hybrid flow shop
