Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time
From MaRDI portal
Publication:2629637
Recommendations
- Minimizing the total completion time in a distributed two stage assembly system with setup times
- Metaheuristic algorithms for the hybrid flowshop scheduling problem
- A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations
- Assembly flowshop scheduling problem: speed-up procedure and computational evaluation
- Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs
Cites work
- A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
- A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages
- A heuristic method for two-stage hybrid flow shop with dedicated machines
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A variable neighborhood decomposition search method for supply chain management planning problems
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
- An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- Design and analysis of experiments.
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
- Future paths for integer programming and links to artificial intelligence
- Heuristics for scheduling in a flow shop with multiple processors
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- Optimization of process plans using a constraint-based tabu search approach
- Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
- Sequencing a hybrid two-stage flowshop with dedicated machines
- Simulated annealing: A tool for operational research
- The three-stage assembly flowshop scheduling problem
- The two-stage assembly scheduling problem to minimize total completion time with setup times
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
- Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type
- Total completion time with makespan constraint in no-wait flowshops with setup times
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
Cited in
(8)- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
- A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations
- Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system
- An efficient MILP-based decomposition strategy for solving large-scale scheduling problems in the shipbuilding industry
- Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs
- Hybrid estimation of distribution algorithm for three-stage assembly integrated scheduling problem considering assembly synchronization and delivery punctuality
- A constraint programming approach for resource-constrained flexible assembly flow shop scheduling problem with batch direct delivery
- Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times
This page was built for publication: Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629637)
