Minimizing the total completion time in a distributed two stage assembly system with setup times
DOI10.1016/J.COR.2014.02.005zbMATH Open1348.90328OpenAlexW2083233352MaRDI QIDQ337027FDOQ337027
Feng Wang, Fuli Xiong, Libin Han, Keyi Xing, Hang Lei
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.02.005
Recommendations
- The two-stage assembly scheduling problem to minimize total completion time with setup times
- The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic
- A hybrid tabu search heuristic for the two-stage assembly scheduling problem
- Two-stage assembly scheduling problem for minimizing total tardiness with setup times
- Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Future paths for integer programming and links to artificial intelligence
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- Title not available (Why is that?)
- The distributed permutation flowshop scheduling problem
- The two-stage assembly scheduling problem to minimize total completion time with setup times
- Title not available (Why is that?)
- An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
- A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
- A variable neighborhood decomposition search method for supply chain management planning problems
- A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
- 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
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
- Title not available (Why is that?)
- The three-stage assembly 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
Cited In (8)
- The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic
- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
- Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion
- Two-stage assembly scheduling problem for minimizing total tardiness with setup times
- A hybrid multi-objective approach for real-time flexible production scheduling and rescheduling under dynamic environment in Industry 4.0 context
- Just-in-time scheduling for a distributed concrete precast flow shop system
- A learning-based two-stage optimization method for customer order scheduling
- Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups
This page was built for publication: Minimizing the total completion time in a distributed two stage assembly system with setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337027)
