Sequencing in an Assembly Line with Blocking to Minimize Cycle Time

DOI10.1287/OPRE.37.6.925zbMATH Open0689.90048OpenAlexW2131446946MaRDI QIDQ3032070FDOQ3032070

Authors: S. Thomas McCormick, Barry Wolf, Michael L. Pinedo, Scott Shenker 

Publication date: 1989

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.37.6.925

Recommendations

• Concurrent operations assignment and sequencing for particular assembly problems in flow lines
• On Assembly-Line Balancing Problems
• Sequencing mixed-model assembly lines to level parts usage and minimize line length
• Assembly line balancing in a mixed-model sequencing environment with synchronous transfers.
• Minimizing Cycle Time in a Blocking Flowshop

zbMATH Keywords

heuristicmaximum flowfinite capacity buffersassembly lineBlockingcritical path techniques

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Cited In (62)

• Linear programming formulation of idle times for single-server discrete-event simulation models
• Resequencing with parallel queues to minimize the maximum number of items in the overflow area
• Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization
• Evaluation of mixed-model U-line operational designs
• Sequencing and loading of products on a flowline
• A hybrid neural approach to combinatorial optimization
• A cutting and scheduling problem in float glass manufacturing
• Sequencing jobs on an automobile assembly line: objectives and procedures
• An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
• Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations
• Evaluating sequences for paced, mixed-model assembly lines with JIT component fabrication
• An Operational Strategy for Throughput Maximization and Bottleneck Control in an Assembly Line System: By Selection of the Processing Rates
• A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion
• A review of TSP based approaches for flowshop scheduling
• Sequencing jobs for an automated manufacturing module with buffer
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
• Open shop cyclic scheduling
• An optimization-based heuristic for the robotic cell problem
• A mixed integer programming model for the cyclic job-shop problem with transportation
• Simple heuristics for scheduling with limited intermediate storage
• Cyclic flow-shop scheduling with no-wait constraints and missing operations
• Benders' decomposition for the balancing of assembly lines with stochastic demand
• The complexity of scheduling jobs in repetitive manufacturing systems
• An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers.
• Sequencing of robot activities and parts in two-machine robotic cells
• Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
• Scheduling manufacturing systems with blocking: a Petri net approach
• A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
• An analytic framework for sequencing mixed model assembly lines
• A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
• Continuous flow models for batch manufacturing: a basis for a hierarchical approach
• An approach to production planning and scheduling in cyclically scheduled manufacturing systems
• The evolution of schematic representations of flow shop scheduling problems
• Optimizing blocking flow shop scheduling problem with total completion time criterion
• A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
• A branch and bound algorithm for the cyclic job-shop problem with transportation
• Minimizing Cycle Time in a Blocking Flowshop
• Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems
• The interface of buffer design and cyclic scheduling decisions in deterministic flow lines
• Two-stage heuristic algorithms for part input sequencing in flexible manufacturing systems
• A general model for cyclic machine scheduling problems
• Cyclic job scheduling in paced assembly lines with cross-trained workers
• The complexity of a cyclic scheduling problem with identical machines and precedence constraints
• Cyclic job shop scheduling problems with blocking
• Scheduling jobshops with some identical or similar jobs
• Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints
• Cyclic hoist scheduling in large real-life electroplating lines
• A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
• Optimal versus heuristic scheduling of surface mount technology lines
• A fluid approach to large volume job shop scheduling
• The complexity of cyclic shop scheduling problems
• A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking
• Some complexity results in cyclic scheduling
• Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem
• An aggregation procedure for simulating manufacturing flow line models
• Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers
• A job-splitting heuristic for lot-size scheduling in multi-stage, multi- product production processes
• Cyclic scheduling to minimize inventory in a batch flow line
• Alternative graph formulation for solving complex factory-scheduling problems
• Job-shop scheduling with blocking and no-wait constraints
• Loading and scheduling of a flexible assembly system by mixed integer programming.
• Scheduling in network flow shops

This page was built for publication: Sequencing in an Assembly Line with Blocking to Minimize Cycle Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3032070)