Heuristic approach for N-job, 3-machine flow shop scheduling problem involving transportation time, break down time and weights of jobs

DOI10.3390/MCA10020301MaRDI QIDQ2574384zbMATH OpenOpenAlexFDO

Authors A. B. Chandramouli

Publication date 21 November 2005

Published in Mathematical \& Computational Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/mca10020301

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Review text

Summary: 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 an optimal or near optimal sequence minimizing the total weighted mean production flow time for the problem has been discussed.

Recommendations

• scientific article; zbMATH DE number 4068595
• scientific article; zbMATH DE number 3848955
• scientific article; zbMATH DE number 3848956
• scientific article; zbMATH DE number 4043597
• Solving constrained flow-shop scheduling problems with three machines

Cited in

(10)

• Solving constrained flow-shop scheduling problems with three machines
• scientific article; zbMATH DE number 3848955 (Why is no real title available?)
• scientific article; zbMATH DE number 3848956 (Why is no real title available?)
• scientific article; zbMATH DE number 3864975 (Why is no real title available?)
• scientific article; zbMATH DE number 3930697 (Why is no real title available?)
• scientific article; zbMATH DE number 4043597 (Why is no real title available?)
• scientific article; zbMATH DE number 4068595 (Why is no real title available?)
• Constrained multi-stage flowshop scheduling including transportation time and weights of jobs with break-down interval having job block criteria, the processing time associated with their respective probabilities
• scientific article; zbMATH DE number 975784 (Why is no real title available?)
• Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines

This page was built for publication: Heuristic approach for \(N\)-job, 3-machine flow shop scheduling problem involving transportation time, break down time and weights of jobs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2574384)