Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
From MaRDI portal
Publication:3032070
DOI10.1287/opre.37.6.925zbMath0689.90048OpenAlexW2131446946MaRDI QIDQ3032070
Barry Wolf, S. Thomas McCormick, Michael L. Pinedo, Scott J. 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
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Deterministic network models in operations research (90B10)
Related Items (58)
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 ⋮ Optimal versus heuristic scheduling of surface mount technology lines ⋮ The interface of buffer design and cyclic scheduling decisions in deterministic flow lines ⋮ Some complexity results in cyclic scheduling ⋮ Cyclic flow-shop scheduling with no-wait constraints and missing operations ⋮ An analytic framework for sequencing mixed model assembly lines ⋮ Cyclic hoist scheduling in large real-life electroplating lines ⋮ Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) 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 ⋮ Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion ⋮ Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption ⋮ A branch and bound algorithm for the cyclic job-shop problem with transportation ⋮ Simple heuristics for scheduling with limited intermediate storage ⋮ An aggregation procedure for simulating manufacturing flow line models ⋮ A hybrid neural approach to combinatorial optimization ⋮ A fluid approach to large volume job shop scheduling ⋮ A cutting and scheduling problem in float glass manufacturing ⋮ Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization ⋮ A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking ⋮ An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. ⋮ A mixed integer programming model for the cyclic job-shop problem with transportation ⋮ Loading and scheduling of a flexible assembly system by mixed integer programming. ⋮ A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion ⋮ Cyclic job shop scheduling problems with blocking ⋮ Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints ⋮ Open shop cyclic scheduling ⋮ A general model for cyclic machine scheduling problems ⋮ An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers ⋮ A three-phase algorithm for flowshop scheduling with blocking to minimize makespan ⋮ An approach to production planning and scheduling in cyclically scheduled manufacturing systems ⋮ Continuous flow models for batch manufacturing: a basis for a hierarchical approach ⋮ Two-stage heuristic algorithms for part input sequencing in flexible manufacturing systems ⋮ Scheduling jobshops with some identical or similar jobs ⋮ Alternative graph formulation for solving complex factory-scheduling problems ⋮ Scheduling manufacturing systems with blocking: a Petri net approach ⋮ Cyclic job scheduling in paced assembly lines with cross-trained workers ⋮ Benders' decomposition for the balancing of assembly lines with stochastic demand ⋮ The evolution of schematic representations of flow shop scheduling problems ⋮ Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem ⋮ The complexity of a cyclic scheduling problem with identical machines and precedence constraints ⋮ Sequencing jobs for an automated manufacturing module with buffer ⋮ Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations ⋮ A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems ⋮ An optimization-based heuristic for the robotic cell problem ⋮ Scheduling in network flow shops ⋮ Sequencing and loading of products on a flowline ⋮ Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers ⋮ Linear Programming Formulation of Idle Times for Single-Server Discrete-Event Simulation Models ⋮ A review of TSP based approaches for flowshop scheduling ⋮ Job-shop scheduling with blocking and no-wait constraints ⋮ Evaluating sequences for paced, mixed-model assembly lines with JIT component fabrication ⋮ Sequencing of robot activities and parts in two-machine robotic cells ⋮ The complexity of scheduling jobs in repetitive manufacturing systems ⋮ Evaluation of mixed-model U-line operational designs ⋮ The complexity of cyclic shop scheduling problems ⋮ A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
This page was built for publication: Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
