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.90045OpenAlexW2007547395MaRDI 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

schedulingtabu searchheuristicdistributed database systemmaximum latenessparticle swarm optimizationassembly flowshop

Mathematics Subject Classification ID

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

Related Items (24)

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time ⋮ Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems ⋮ Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect ⋮ Minimizing the total completion time in a distributed two stage assembly system with setup times ⋮ The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic ⋮ 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 ⋮ Lot streaming for a two-stage assembly system in the presence of handling costs ⋮ A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks ⋮ Two-stage assembly scheduling with batch setup times, time-dependent deterioration, and preventive maintenance activities using meta-heuristic algorithms ⋮ Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect ⋮ A discrete particle swarm optimization for lot-streaming flowshop scheduling problem ⋮ A new particle swarm optimization for the open shop scheduling problem ⋮ A scheduling problem to minimize total weighted tardiness in the two-stage assembly flowshop ⋮ Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs ⋮ A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem ⋮ A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness ⋮ Two-stage assembly scheduling problem for minimizing total tardiness with setup times ⋮ A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times ⋮ 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 ⋮ Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times

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

This page was built for publication: A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application