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

DOI10.1016/J.COR.2014.02.005MaRDI QIDQ337027zbMATHOpenAlexFDO

Authors Fuli Xiong, Keyi Xing, Feng Wang, Hang Lei, Libin Han

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

schedulinghybrid meta-heuristicstotal completion timedistributed two-stage assembly flowshop

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
• 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 self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
• A variable neighborhood decomposition search method for supply chain management planning problems
• An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
• Design and analysis of experiments.
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• 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
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• Simulated annealing: A tool for operational research
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
• The distributed permutation flowshop scheduling problem
• The three-stage assembly flowshop scheduling problem
• The two-stage assembly scheduling problem to minimize total completion time with setup times
• Variable neighborhood search
• Variable neighborhood search: Principles and applications

Cited in

(11)

• 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
• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
• A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time
• Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs
• Two-stage assembly scheduling problem for minimizing total tardiness with setup times
• Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time
• The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic
• 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

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)