Minimizing makespan in hybrid flowshops
From MaRDI portal
Publication:1342286
Recommendations
Cites work
- A loading and dispatching problem in a random flexible manufacturing system
- A state-of-the-art review of parallel-machine scheduling research
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- Bounds for Certain Multiprocessing Anomalies
- Flowshop and Jobshop Schedules: Complexity and Approximation
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- Optimal two- and three-stage production schedules with set-up time included
- Routing flexibility and production scheduling in a flexible manufacturing system
- Scheduling algorithms for flexible flowshops: Worst and average case performance
- Some no-wait shops scheduling problems: Complexity aspect
- Two-Stage, Hybrid Flowshop Scheduling Problem
Cited in
(66)- Scheduling hybrid flowshop with parallel batching machines and compatibilities
- Minimizing makespan in two-stage hybrid cross docking scheduling problem
- Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint
- A hybrid two-stage flowshop with part family, batch production, major and minor set-ups
- Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines
- Two-machine flowshop scheduling with availability constraints
- A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
- Flowshop scheduling with identical jobs and uniform parallel machines
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Heuristic algorithms for the two-stage hybrid flowshop problem
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
- An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers.
- Hybrid flow-shop scheduling problems with multiprocessor task systems.
- Concurrent flowshop scheduling to minimize makespan.
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- Heuristics for the two-stage job shop scheduling problem with a bottleneck machine
- Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage
- Heuristics for periodical batch job scheduling in a MapReduce computing framework
- On the optimality conditions of the two-machine flow shop problem
- Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- Scheduling flexible flow lines with sequence-dependent setup times
- Two-stage proportionate flexible flow shop to minimize the makespan
- Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
- Improved approximation algorithms for two-stage flexible flow shop scheduling
- Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage
- The hybrid flow shop scheduling problem
- Scheduling jobs on a \(k\)-stage flexible flow-shop
- Flow shops with reentry: reversibility properties and makespan optimal schedules
- Approximation algorithms for two-stage flexible flow shop scheduling
- A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
- A note on makespan minimization in two-stage flexible flow shops with uniform machines
- Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
- Scheduling two-stage hybrid flow shop with availability constraints
- An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop
- The master-slave paradigm in parallel computer and industrial settings
- Flexible flow shop scheduling with uniform parallel machines
- An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
- Hybrid flow-shop with adjustment
- Optimal versus heuristic scheduling of surface mount technology lines
- A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines
- A two-stage hybrid flow shop with dedicated machines at the first stage
- An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions
- Minimizing makespan and throughput times at Aalsmeer flower auction
- Two-Stage, Hybrid Flowshop Scheduling Problem
- Approximation algorithms for the parallel flow shop problem
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- Aggregate planning in hybrid flowshops
- Minimizing makespan in parallel flowshops
- scientific article; zbMATH DE number 1462947 (Why is no real title available?)
- A PTAS for the multiple parallel identical multi-stage flow-shops to minimize the makespan
- Sequencing a hybrid two-stage flowshop with dedicated machines
- Solving then-job 3-stage flexible flowshop scheduling problem using an agent-based approach
- Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
- scientific article; zbMATH DE number 1437089 (Why is no real title available?)
- An FPTAS for the parallel two-stage flowshop problem
- A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately
- Bounding strategies for the hybrid flow shop scheduling problem
- Minimizing total completion time in two-stage hybrid flow shop with dedicated machines
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
- Optimal scheduling of a two-stage hybrid flow shop
- A taxonomy of flexible flow line scheduling procedures
- A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal
- A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines
- Scheduling problems in master-slave model
- Modeling realistic hybrid flexible flowshop scheduling problems
This page was built for publication: Minimizing makespan in hybrid flowshops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342286)
