BI-CRITERIA SDST FLOW SHOP SCHEDULING USING

ARTIFICIAL BEE COLONY (ABC) ALGORITHM

A PROJECT REPORT (PHASE I)

Submitted by

SARBUDEEN K

REGISTER NO: 921511402014

in partial fulfillment for the award of the degree

of

MASTER OF ENGINEERING

in

CAD/CAM

R.V.S COLLEGE OF ENGINEERING & TECHNOLOGY,

DINDIGUL 05

ANNA UNIVERSITY: CHENNAI 600 025

OCTOBER 2012

i
 ANNA UNIVERSITY: CHENNAI 600 025

BONAFIDE CERTIFICATE

Certified that this project report “BI-CRITERIA SDST FLOW SHOP

SCHEDULING USING ARTIFICIAL BEE COLONY (ABC) ALGORITHM” is
the bonafide work of “SARBUDEEN.K” who carried out the project work under my
supervision.

SIGNATURE SIGNATURE

Mr. R.SANJEEV KUMAR, M.E.,

HEAD OF THE DEPARTMENT SUPERVISOR

Professor, Assistant Professor,

Department of mechanical engineering, Department of mechanical engineering,

R.V.S College of Engineering & Technology, R.V.S College of Engineering & Technology,

Dindigul. Dindigul.

Submitted for viva-voce (phase-1) examination held at R.V.S College of Engineering & Technology,

Dindigul on _______________________

INTERNAL EXAMINER EXTERNAL EXAMINER

ii
 ABSTRACT

The flow shop scheduling problem (FSSP) with sequence dependent setup times
(SDST) is one of the most complex class of scheduling problems. Efficient supervision
of sequence dependent setup times (SDSTs) is one of the significant features to enhance
the performance of manufacturing system. In the present work, the Artificial Bee Colony
(ABC) algorithm has been proposed for bi-criteria SDST flow shop scheduling problem.
The objective function considers the minimizing makespan and number of tardy jobs.
The performance of proposed method has been compared with SA(NEH) and
SA(NEH_EDD). The proposed method produce better results for other problems.

Keywords: Flow shop scheduling, Sequence dependent set up time Artificial Bee
Colony (ABC) algorithm, makespan, number of tardy Jobs.

iii
 ACKNOWLEDGMENT

We express our deepest gratitude to our Dr.K.V.Kuppusamy, for his invaluable

guidance and blessings.

We are very grateful to our Principal Dr.C.G.Ravichandran, M.E., PH.D., for

providing us with an environment to complete our project successfully.

We would like to thank Our Head of the Department

Dr.V.Srinivasa Raman, M.E PH.D, for his unwavering support during the entire

course of this project work.

We are deeply indebted to our HOD Incharge

Dr. M. Rajkumar, M.E, Ph.D (NIT), who modeled us both technically and morally for

achieving greater success in life.

We are very much indebted to our supervisor Mr. R. Sanjeeve kumar, M.E., who

have supported us in all endeavors and inspired us to make our project successfully.

Finally, we take this opportunity to extend our deep appreciation to our

family and friends, for all that they meant to us during the crucial times of the

completion of our project.

iv
 LIST OF FIGURES

Figure no Title Page no

Figure 1 Classification of scheduling problems 4
based on requirement generations.

v
 TABLE OF CONTENTS

CHAPTER
TITLE PAGE NO.
NO.
ABSTRACT iii

LIST OF FIGURES v
1 INTRODUCTION 1
1.1 TYPES OF SCHEDULING 3
1.2 SET UP TIME 8
1.3 SEQUENCE DEPENDENT SET UP TIME (SDST) 10
2 LITERATURE REVIEW 11
3 PROBLEM DESCRIPTION 15
3.1 ASSUMPTIONS 15
3.2 MATHEMATICAL MODEL 16
3.3 NOTATIONS 17
4 ARTIFICIAL BEE COLONY (ABC) 18
4.1 ARTIFICIAL BEE COLONY ALGORITHM STEPS 20
4.2 FLOW CHART OF ARTIFICIAL BEE COLONY 22
ALGORITHM
5 REFERENCES 23

vi