Scheduling jobs on a \(k\)-stage flexible flow-shop
From MaRDI portal
Publication:2271811
DOI10.1007/s10479-007-0257-2zbMath1169.90360OpenAlexW2042369375MaRDI QIDQ2271811
Jairo R. Montoya-Torres, Carlos D. Paternina-Arboleda, Milton J. Acero-Dominguez, Maria C. Herrera-Hernandez
Publication date: 4 August 2009
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-007-0257-2
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (13)
Hybrid flexible flowshop problems: models and solution methods ⋮ Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Practical solutions for a dock assignment problem with trailer transportation ⋮ Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem ⋮ Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises ⋮ An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation ⋮ Two-stage hybrid flow shop with recirculation ⋮ Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective ⋮ Comments on ``Scheduling jobs on a \(k\)-stage flexible flow-shop [Annals of operations research (2008) 164: 29-40] ⋮ Scheduling jobs on a \(k\)-stage flexible flow-shop ⋮ Optimal solutions for a dock assignment problem with trailer transportation ⋮ A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines ⋮ Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem
Cites Work
- Branch and bound algorithm for the flow shop with multiple processors
- Scheduling a hybrid flowshop with batch production at the last stage
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- Global lower bounds for flow shops with multiple processors
- Branch and bound crossed with GA to solve hybrid flowshops
- A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
- Flowshop scheduling with identical jobs and uniform parallel machines
- Minimizing makespan in hybrid flowshops
- Heuristic algorithms for the two-stage hybrid flowshop problem
- An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers.
- Hybrid flow-shop scheduling problems with multiprocessor task systems.
- A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
- Scheduling jobs on a \(k\)-stage flexible flow-shop
- Scheduling two-stage hybrid flow shop with availability constraints
- A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms
- A simulation study of some simple estimators for the three-parameter weibull distribution
- Two-Stage, Hybrid Flowshop Scheduling Problem
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
- Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
- A flexible flowshop problem with total flow time minimization
- Integrating interval estimates of global optima and local search methods for combinatorial optimization problems
- Experimental evaluation of heuristic optimization algorithms: A tutorial
- Using a hybrid of exact and genetic algorithms to design survivable networks
- Preemptive hybrid flowshop scheduling problem of interval orders
This page was built for publication: Scheduling jobs on a \(k\)-stage flexible flow-shop
