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

Authors:
Javad Navaei;Seyyed Mohammad Taghi Fatemi Ghomi;Fariborz Jolai;Ashkan Mozdgir
Affiliations:
-;-;-;-
Venue:
Computers and Operations Research
Year:
2014

Citing 16
Cited 0

Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem

Management Science
A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem

Computers and Operations Research
A heuristic algorithm for master planning that satisfies multiple objectives

Computers and Operations Research
The two-stage assembly scheduling problem to minimize total completion time with setup times

Computers and Operations Research
Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm

Expert Systems with Applications: An International Journal
Scheduling Flexible Servers with Convex Delay Costs in Many-Server Service Systems

Manufacturing & Service Operations Management
Two-stage hybrid batching flowshop scheduling with blocking and machine availability constraints using genetic algorithm

Robotics and Computer-Integrated Manufacturing
A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application

Computers and Operations Research
The production scheduling problem in a multi-page invoice printing system

Computers and Operations Research
Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem

Expert Systems with Applications: An International Journal
Solving the integrated product mix-outsourcing problem using the Imperialist Competitive Algorithm

Expert Systems with Applications: An International Journal
An efficient hybrid algorithm based on modified imperialist competitive algorithm and K-means for data clustering

Engineering Applications of Artificial Intelligence
Solving a group layout design model of a dynamic cellular manufacturing system with alternative process routings, lot splitting and flexible reconfiguration by simulated annealing

Computers and Operations Research
Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost

Computers and Industrial Engineering
An agent-based parallel approach for the job shop scheduling problem with genetic algorithms

Mathematical and Computer Modelling: An International Journal
Minimizing total expected costs in the two-machine, stochastic flow shop

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses the two-stage assembly flow-shop scheduling problem with non-identical assembly machines at the second stage to minimize a sum of holding and delay costs. Although there are more than one assembly machine in many manufacturing systems, to the best of our knowledge, the two-stage assembly flow-shop scheduling problem (TSAFSP) has never been addressed with more than one assembly machine at stage two. Moreover, setup time is an inevitable factor in many cases and so in this paper, for more reality, sequence dependent setup times are considered for both stages. After extending mathematical modeling, to solve the addressed problem, four hybrid meta-heuristics are developed. A simulated annealing algorithm (SA) and an imperialist competitive algorithm (ICA) in order to find a sequence of jobs at the first stage and a heuristic (HEU) and again SA for assigning addressed jobs to assembly machines in stage two; therefore, these hybrid meta-heuristics are SA+HEU, ICA+HEU, SA+SA and ICA+SA. Computational results reveal that ICA+HEU outperforms all other algorithms; however, the run time of SA+HEU is the smallest among the algorithms.