Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times

DOI10.1080/00207540600621029zbMath1114.90373OpenAlexW2015385382WikidataQ57717979 ScholiaQ57717979MaRDI QIDQ3430247

Ali Allahverdi, Fawaz S. Al-Anzi

Publication date: 21 March 2007

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540600621029

zbMATH Keywords

schedulingtabu searchmakespansetup timesPSOassembly 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

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures, A particle swarm optimisation algorithm for multi-plant assembly sequence planning with integrated assembly sequence planning and plant assignment, Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time, 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, Assembly flowshop scheduling problem: speed-up procedure and computational evaluation, A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem, Lot streaming for a two-stage assembly system in the presence of handling costs, Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing, Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect, A survey of scheduling problems with setup times or costs, Two-stage assembly scheduling problem for minimizing total tardiness with 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

Cites Work

• 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
• 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
• Heuristic optimization system for the determination of index positions on CNC magazines with the consideration of cutting tool duplications
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
• The three-stage assembly flowshop scheduling problem
• Tabu search for a class of single-machine scheduling problems