Heuristic approach for \(N\)-job, 3-machine flow shop scheduling problem involving transportation time, break down time and weights of jobs (Q2574384)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Heuristic approach for N-job, 3-machine flow shop scheduling problem involving transportation time, break down time and weights of jobs |
scientific article; zbMATH DE number 2230631
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristic approach for \(N\)-job, 3-machine flow shop scheduling problem involving transportation time, break down time and weights of jobs |
scientific article; zbMATH DE number 2230631 |
Statements
Heuristic approach for \(N\)-job, 3-machine flow shop scheduling problem involving transportation time, break down time and weights of jobs (English)
0 references
21 November 2005
0 references
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.
0 references
0.8592804074287415
0 references
