A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
From MaRDI portal
Publication:1025264
DOI10.1016/j.cor.2009.02.004zbMath1162.90448OpenAlexW1988854296MaRDI QIDQ1025264
Chun-Lung Chen, Chuen-Lung S. Chen
Publication date: 18 June 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.02.004
makespanunrelated parallel machinesbottleneckflexible flow linebottleneck-based multiple insertion heuristic
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Minimizing resource consumption on uniform parallel machines with a bound on makespan ⋮ Auxiliary resource planning in a flexible flow shop scheduling problem considering stage skipping
Uses Software
Cites Work
- Unnamed Item
- Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- Scheduling of flexible flow lines in an automobile assembly plant
- Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment
- An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers.
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
- Heuristics for scheduling in a flow shop with multiple processors
- A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
- Scheduling jobs on a \(k\)-stage flexible flow-shop
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
- A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- Optimal two- and three-stage production schedules with setup times included
- A survey and evaluation of static flowshop scheduling heuristics
- Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- An Evaluation of Flow Shop Sequencing Heuristics
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- A flowshop scheduling problem with two operations per job
- A comparison of sequencing rules in static and dynamic hybrid flow systems
- Comparison of Scheduling Rules in a Flow Shop with Multiple Processors: A Simulation
- Bottleneck-focused scheduling for a hybrid flowshop
- Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
- A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system
- Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
