A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application

DOI10.1016/j.cor.2004.09.002zbMath1079.90045MaRDI QIDQ2571194

Ali Allahverdi, Fawaz S. Al-Anzi

Publication date: 1 November 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2004.09.002

zbMATH Keywords

scheduling; tabu search; heuristic; distributed database system; maximum lateness; particle swarm optimization; assembly flowshop

Mathematics Subject Classification ID

90B40: Search theory

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop, A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times, A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines, A discrete particle swarm optimization for lot-streaming flowshop scheduling problem, Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan, The two-stage assembly scheduling problem to minimize total completion time with setup times, A new particle swarm optimization for the open shop scheduling problem, A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times, Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times, A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks

Cites Work

• Unnamed Item
• Job lateness in a two-machine flowshop with setup times separated
• A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
• A branch and bound algorithm for the two-stage assembly scheduling problem
• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
• 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
• Correctness of query execution strategies in distributed databases
• 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
• The three-stage assembly flowshop scheduling problem