Pages that link to "Item:Q3032070"
From MaRDI portal
The following pages link to Sequencing in an Assembly Line with Blocking to Minimize Cycle Time (Q3032070):
Displaying 50 items.
- Optimizing blocking flow shop scheduling problem with total completion time criterion (Q336393) (← links)
- A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223) (← links)
- A branch and bound algorithm for the cyclic job-shop problem with transportation (Q339670) (← links)
- A cutting and scheduling problem in float glass manufacturing (Q398905) (← links)
- A mixed integer programming model for the cyclic job-shop problem with transportation (Q442206) (← links)
- A fluid approach to large volume job shop scheduling (Q600845) (← links)
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking (Q817122) (← links)
- Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems (Q856670) (← links)
- Simple heuristics for scheduling with limited intermediate storage (Q868994) (← links)
- Cyclic job shop scheduling problems with blocking (Q940885) (← links)
- A general model for cyclic machine scheduling problems (Q955322) (← links)
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems (Q1038288) (← links)
- An optimization-based heuristic for the robotic cell problem (Q1040983) (← links)
- Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem (Q1268163) (← links)
- The complexity of a cyclic scheduling problem with identical machines and precedence constraints (Q1278237) (← links)
- Sequencing jobs for an automated manufacturing module with buffer (Q1278543) (← links)
- The complexity of scheduling jobs in repetitive manufacturing systems (Q1310021) (← links)
- A job-splitting heuristic for lot-size scheduling in multi-stage, multi- product production processes (Q1331612) (← links)
- Cyclic scheduling to minimize inventory in a batch flow line (Q1331620) (← links)
- The interface of buffer design and cyclic scheduling decisions in deterministic flow lines (Q1339132) (← links)
- Some complexity results in cyclic scheduling (Q1341404) (← links)
- An aggregation procedure for simulating manufacturing flow line models (Q1374035) (← links)
- An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. (Q1410120) (← links)
- Loading and scheduling of a flexible assembly system by mixed integer programming. (Q1420407) (← links)
- Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers (Q1585811) (← links)
- The complexity of cyclic shop scheduling problems (Q1607980) (← links)
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion (Q1652026) (← links)
- Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption (Q1652150) (← links)
- A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion (Q1736840) (← links)
- Open shop cyclic scheduling (Q1750495) (← links)
- A three-phase algorithm for flowshop scheduling with blocking to minimize makespan (Q1761237) (← links)
- Job-shop scheduling with blocking and no-wait constraints (Q1848398) (← links)
- A hybrid neural approach to combinatorial optimization (Q1915983) (← links)
- Benders' decomposition for the balancing of assembly lines with stochastic demand (Q2030547) (← links)
- Cyclic flow-shop scheduling with no-wait constraints and missing operations (Q2140312) (← links)
- The evolution of schematic representations of flow shop scheduling problems (Q2304109) (← links)
- A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking (Q2423281) (← links)
- Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints (Q2467264) (← links)
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers (Q2475841) (← links)
- Scheduling in network flow shops (Q2564878) (← links)
- Sequencing and loading of products on a flowline (Q2569078) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- Cyclic hoist scheduling in large real-life electroplating lines (Q2642305) (← links)
- Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations (Q2830959) (← links)
- Evaluation of mixed-model U-line operational designs (Q2865171) (← links)
- Scheduling manufacturing systems with blocking: a Petri net approach (Q3055253) (← links)
- Optimal versus heuristic scheduling of surface mount technology lines (Q3159686) (← links)
- An analytic framework for sequencing mixed model assembly lines (Q3990963) (← links)
- Evaluating sequences for paced, mixed-model assembly lines with JIT component fabrication (Q4230297) (← links)
- Sequencing of robot activities and parts in two-machine robotic cells (Q4230317) (← links)
