Baskar P

Department of Automotive Engineering

School of Mechanical Engineering

Vellore Campus

Anthony Xavior M

Department of Manufacturing Engineering

Fulltext

Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

Procedia Engineering

Finding an optimal sequence in terms of total completion time for processing ‘n’ jobs in ‘m’ processing centers in the shop floor is an important job for a shop floor supervisor. The problem is NP hard as the total number of sequences is (n!) for a permutation flow shop scheduling problem. Starting from Johnson’s Algorithm, many classical Heuristics were proposed in earlier days. After the invention of evolutionary algorithms and Meta Heuristics, finding an optimal sequence becomes comparatively easier. This paper deals with improving one such performance parameter, the make span, in a Permutation Flow Shop Scheduling problem in case of job idle times (though machines are available, jobs are not) observed in between two machines. The case of three machines, n jobs has been analyzed using the well known Taillard bench mark problems by coding in MATLAB R2008a and a new procedure has been proposed.

Key Engineering Materials

Solving Permutation Flow Shop Scheduling Problems with Job Idle Time in between Two Machines

A Simple Model to Optimize General Flow-Shop Scheduling Problems With Known Break Down Time And Weights Of Jobs

Mathematical and Computational Applications

Heuristic Approach for N-Job, 3-Machine Flow Shop Scheduling Problem Involving Transportation Time, Break Down Time and Weights of Jobs

International Journal of Production Economics

The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem

Omega

A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem

Optimization of Makespan in Job and Machine Priority Environment

Journal	Data powered by TypesetProcedia Engineering
Publisher	Data powered by TypesetElsevier BV
ISSN	1877-7058
Open Access	Yes