Next Article in Journal
Pressure Distribution in a Slider Bearing Lubricated with Second and Third Grade Fluids
Previous Article in Journal
Join for (Augmented) Simplicial Group
Article Menu

Article Versions

Export Article

Open AccessArticle
Math. Comput. Appl. 2005, 10(2), 301-305; doi:10.3390/mca10020301

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

Department of P.G. Studies and Research in Mathematics, M.S. College Saharanpur 247001, India
Published: 1 August 2005
Download PDF [100 KB, uploaded 31 March 2016]

Abstract

This paper provides a new simple heuristic algorithm for a ‘3-Machine, n-job’ flow-shop scheduling problem in which jobs are attached with weights to indicate their relative importance and the transportation time and break down intervals of machine are given. A heuristic approach method to find optimal or near optimal sequence minimizing the total weighted mean production flow time for the problem has been discussed.
Keywords: Break down time; Weights of jobs Break down time; Weights of jobs
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Chandramouli, A.B. Heuristic Approach for N-Job, 3-Machine Flow Shop Scheduling Problem Involving Transportation Time, Break Down Time and Weights of Jobs. Math. Comput. Appl. 2005, 10, 301-305.

Show more citation formats Show less citations formats

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Math. Comput. Appl. EISSN 2297-8747 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top