Assembly flowshop scheduling problem: speed-up procedure and computational evaluation
Publication:2670518
DOI10.1016/j.ejor.2021.10.001zbMath1495.90070OpenAlexW3205822589MaRDI QIDQ2670518
Carla Talens, Victor Fernandez-Viagas, Jose M. Framinan
Publication date: 11 March 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.10.001
heuristicsschedulingmakespanflow shopcomputational evaluationASPaccelerationsmultistage assemblyspeed-up procedurethree-stage assemblytwo-stage assembly
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New hard benchmark for flowshop scheduling problems minimising makespan
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Order scheduling in an environment with dedicated resources in parallel
- Some efficient heuristic methods for the flow shop sequencing problem
- An improved NEH-based heuristic for the permutation flowshop problem
- The production scheduling problem in a multi-page invoice printing system
- An empirical analysis of the optimality rate of flow shop heuristics
- The distributed permutation flowshop scheduling problem
- Heuristics for the flow line problem with setup costs
- The flow shop with parallel machines: A tabu search approach
- The permutation flow shop with buffers: A tabu search approach
- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
- The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations
- New approximate algorithms for the customer order scheduling problem with total completion time objective
- Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
- A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
- Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- Benchmarks for basic scheduling problems
- An improved NEH heuristic to minimize makespan in permutation flow shops
- Optimal two- and three-stage production schedules with setup times included
- Coordinated scheduling of customer orders for quick response
- Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
- An Evaluation of Flow Shop Sequencing Heuristics
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Scheduling
- The three-stage assembly flowshop scheduling problem
This page was built for publication: Assembly flowshop scheduling problem: speed-up procedure and computational evaluation