Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop

DOI10.1016/J.ADVENGSOFT.2010.06.004zbMath1201.90086OpenAlexW1976564109MaRDI QIDQ602916

E. Torabzadeh, Mostafa Zandieh

Publication date: 5 November 2010

Published in: Advances in Engineering Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.advengsoft.2010.06.004

zbMATH Keywords

makespansimulated annealing algorithmcloud theorymean competition timetwo-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 ⋮ Total completion time with makespan constraint in no-wait flowshops with setup times ⋮ A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration ⋮ Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect ⋮ Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect ⋮ Two-stage assembly scheduling problem for minimizing total tardiness with setup times ⋮ A robust two-machine flow-shop scheduling model with scenario-dependent processing times

Cites Work

• Unnamed Item
• Unnamed Item
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
• The two-stage assembly scheduling problem to minimize total completion time with setup times
• Uncertainty reasoning based on cloud models in controllers
• A branch and bound algorithm for the two-stage assembly scheduling problem
• Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
• A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
• A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• Scheduling alternative operations in two-machine flow-shops
• Minimizing Makespan in a Class of Reentrant Shops
• Optimal scheduling of the 3-machine assembly-type flow shop
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
• Rough Sets and Current Trends in Computing
• Artificial Intelligence with Uncertainty
• The three-stage assembly flowshop scheduling problem

This page was built for publication: Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop