Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs

DOI10.1016/j.cor.2013.10.008zbMath1307.90064OpenAlexW2022547472MaRDI QIDQ2257346

Fariborz Jolai, Ashkan Mozdgir, Javad Navaei, Seyyed Mohammad Taghi Fatemi Ghomi

Publication date: 25 February 2015

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

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

zbMATH Keywords

simulated annealingimperialist competitive algorithmsequence dependent setup timeassembly flow-shopholding and delay costsnon-identical assembly machines

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (3)

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ The third comprehensive survey on scheduling problems with setup times/costs ⋮ Joint optimization of production scheduling and group preventive maintenance planning in multi-machine systems

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• An agent-based parallel approach for the job shop scheduling problem with genetic algorithms
• A heuristic algorithm for master planning that satisfies multiple objectives
• The production scheduling problem in a multi-page invoice printing system
• The two-stage assembly scheduling problem to minimize total completion time with setup times
• A branch and bound algorithm for the two-stage assembly scheduling problem
• Solving a group layout design model of a dynamic cellular manufacturing system with alternative process routings, lot splitting and flexible reconfiguration by simulated annealing
• Minimizing total expected costs in the two-machine, stochastic flow shop
• 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
• Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
• Colonial competitive algorithm
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
• Equation of State Calculations by Fast Computing Machines
• The three-stage assembly flowshop scheduling problem

This page was built for publication: Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs