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

A. B. Chandramouli

doi:10.3390/mca10020301

You are currently viewing a new version of our website. To view the old version click .

Mathematical and Computational Applications is published by MDPI from Volume 21 Issue 1 (2016). Previous articles were published by another publisher in Open Access under a CC-BY (or CC-BY-NC-ND) licence, and they are hosted by MDPI on mdpi.com as a courtesy and upon agreement with Association for Scientific Research (ASR).

Article

1 August 2005

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

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

Version Notes

Order Reprints

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

Article Metrics

Citations

Article Access Statistics

Journal Statistics

Multiple requests from the same IP address are counted as one view.

Join for (Augmented) Simplicial Group

Pressure Distribution in a Slider Bearing Lubricated with Second and Third Grade Fluids