Minimizing the total completion time in a distributed two stage assembly system with setup times

DOI10.1016/j.cor.2014.02.005zbMath1348.90328OpenAlexW2083233352MaRDI QIDQ337027

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

zbMATH Keywords

schedulingtotal completion timehybrid meta-heuristicsdistributed two-stage assembly flowshop

Mathematics Subject Classification ID

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

Related Items (7)

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 ⋮ Just-in-time scheduling for a distributed concrete precast flow shop system ⋮ A hybrid multi-objective approach for real-time flexible production scheduling and rescheduling under dynamic environment in Industry 4.0 context ⋮ 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 ⋮ Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• The two-stage assembly scheduling problem to minimize total completion time with setup times
• The distributed 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
• Future paths for integer programming and links to artificial intelligence
• 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
• Variable neighborhood search: Principles and applications
• The three-stage assembly flowshop scheduling problem

This page was built for publication: Minimizing the total completion time in a distributed two stage assembly system with setup times