Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time
From MaRDI portal
Publication:2629637
DOI10.1016/j.ejor.2014.07.004zbMath1357.90061OpenAlexW1963526825MaRDI QIDQ2629637
Fuli Xiong, Feng Wang, Keyi Xing
Publication date: 6 July 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.07.004
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Total completion time with makespan constraint in no-wait flowshops with setup times
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- A heuristic method for two-stage hybrid flow shop with dedicated machines
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
- Simulated annealing: A tool for operational research
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
- The two-stage assembly scheduling problem to minimize total completion time with setup times
- Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
- Variable neighborhood search
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Heuristics for scheduling in a flow shop with multiple processors
- Future paths for integer programming and links to artificial intelligence
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
- Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type
- A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages
- A variable neighborhood decomposition search method for supply chain management planning problems
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
- Optimization of process plans using a constraint-based tabu search approach
- Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- Sequencing a hybrid two-stage flowshop with dedicated machines
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
- Variable neighborhood search: Principles and applications
- The three-stage assembly flowshop scheduling problem
This page was built for publication: Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time
