A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties

Authors:
J. Behnamian;M. Zandieh
Affiliations:
Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, Tehran, Iran;Department of Industrial Management, Management and Accounting Faculty, Shahid Beheshti University, G.C., Tehran, Iran
Venue:
Expert Systems with Applications: An International Journal
Year:
2011

Citing 13
Cited 4

Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups

Computers and Operations Research
Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach

Computers and Industrial Engineering
A hybrid two-stage flowshop with limited waiting time constraints

Computers and Industrial Engineering
A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time

Computers and Operations Research
Colonial Competitive Algorithm as a Tool for Nash Equilibrium Point Achievement

ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers

Computers and Operations Research
Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times

Computers and Operations Research
Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint

Journal of Heuristics
A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties

Computers and Operations Research
An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness

Expert Systems with Applications: An International Journal
Imperialist competitive algorithm for minimum bit error rate beamforming

International Journal of Bio-Inspired Computation
Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers

Mathematical and Computer Modelling: An International Journal
Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey

Mathematical and Computer Modelling: An International Journal

A novel chemistry based metaheuristic optimization method for mining of classification rules

Expert Systems with Applications: An International Journal
Multiprocessor task scheduling in multistage hybrid flowshops: A hybrid artificial bee colony algorithm with bi-directional planning

Computers and Operations Research
Using meta-heuristics for project scheduling under mode identity constraints

Applied Soft Computing
Erratum: Erratum to "A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadric tardiness penalties" [Expert Syst. Appl. 38 (2011) 14490-14498]

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.05

Visualization

Abstract

Recently introduced colonial competitive algorithm (CCA) has shown its excellent capability on different optimization problems. The aim of this paper is to propose a discrete version of this method to determine a schedule that minimizes sum of the linear earliness and quadratic tardiness in the hybrid flowshops scheduling problem with simultaneously considering effects of sequence-dependent setup times and limited waiting time. In other word we assume that the waiting time for each job between two consecutive stages cannot be greater than a given upper bound. Also for this problem, a mixed integer program is formulated. Computational results are presented to evaluate the performance of the proposed algorithms for problems with different structures.