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
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
MCA
Volume 10
Issue 2
10.3390/mca10020301
mca-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite question_answer Discuss in SciProfiles thumb_up
...
Endorse textsms
...
Comment
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 the previous journal publisher.
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

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

by
A. B. Chandramouli
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
Published: 1 August 2005
Versions Notes

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

Share and Cite

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. https://doi.org/10.3390/mca10020301

AMA Style

Chandramouli AB. Heuristic Approach for N-Job, 3-Machine Flow Shop Scheduling Problem Involving Transportation Time, Break Down Time and Weights of Jobs. Mathematical and Computational Applications. 2005; 10(2):301-305. https://doi.org/10.3390/mca10020301

Chicago/Turabian Style

Chandramouli, A. B. 2005. "Heuristic Approach for N-Job, 3-Machine Flow Shop Scheduling Problem Involving Transportation Time, Break Down Time and Weights of Jobs" Mathematical and Computational Applications 10, no. 2: 301-305. https://doi.org/10.3390/mca10020301

Article Metrics

Back to TopTop