Assembly flowshop scheduling problem: speed-up procedure and computational evaluation

DOI10.1016/J.EJOR.2021.10.001MaRDI QIDQ2670518zbMATH OpenOpenAlexFDO

Authors Victor Fernandez-Viagas, Carla Talens, Jose M. Framinan

Publication date 11 March 2022

Published in European Journal of Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.ejor.2021.10.001

zbMATH Keywords

heuristicsschedulingmakespanflow shopcomputational evaluationASPaccelerationsmultistage assemblyspeed-up procedurethree-stage assemblytwo-stage assembly

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• The three-stage assembly flowshop scheduling problem
• Optimal scheduling of the 3-machine assembly-type flow shop
• Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines

Cites work

• scientific article; zbMATH DE number 3825546 (Why is no real title available?)
• scientific article; zbMATH DE number 3624650 (Why is no real title available?)
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
• A hybrid tabu search heuristic for the two-stage assembly scheduling problem
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• An Evaluation of Flow Shop Sequencing Heuristics
• An empirical analysis of the optimality rate of flow shop heuristics
• An improved NEH heuristic to minimize makespan in permutation flow shops
• An improved NEH-based heuristic for the permutation flowshop problem
• Benchmarks for basic scheduling problems
• Coordinated scheduling of customer orders for quick response
• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
• Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
• Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
• Heuristics for the flow line problem with setup costs
• Introduction to algorithms.
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• New approximate algorithms for the customer order scheduling problem with total completion time objective
• New hard benchmark for flowshop scheduling problems minimising makespan
• Optimal two- and three-stage production schedules with set-up time included
• Order scheduling in an environment with dedicated resources in parallel
• Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
• Reduction of permutation flowshop problems to single machine problems using machine dominance relations
• Scheduling. Theory, algorithms, and systems.
• Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
• Some efficient heuristic methods for the flow shop sequencing problem
• The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
• The distributed permutation flowshop scheduling problem
• The flow shop with parallel machines: A tabu search approach
• The permutation flow shop with buffers: A tabu search approach
• The production scheduling problem in a multi-page invoice printing system
• The three-stage assembly flowshop scheduling problem

Cited in

(3)

• An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints
• Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time
• An algorithm of shortening idle time for the assembly problem

This page was built for publication: Assembly flowshop scheduling problem: speed-up procedure and computational evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2670518)