1998
DOI: 10.1002/(sici)1099-1425(1998100)1:3<157::aid-jos12>3.0.co;2-y
|Get access via publisher |Summarize |Cite
Minimizing total weighted completion time in a proportionate flow shop
Search citation statements
Paper Sections
Select...
55
5
1
0
Citation Types
0
22
0
0
Year Published
1998
2026
Publication Types
Select...
53
4
2
Relationship
0
59
Authors
Journals
Cited by 59 publications
(22 citation statements)
References 6 publications
0
22
0
0
“…Shakhlevich et al [17] showed that the problem of minimizing the total weighted completion time in a proportionate flow shop is solvable in O (n 2 ) time. The proportionate flow shop model can be generalized by describing the processing time on each machine as a function of a processing requirement and a machine-dependent parameter, e.g., machine speed or other machine specific value.…”
Section: Literature Review and Preliminary Results
mentioning
confidence: 99%
“…Shakhlevich et al [17] showed that the problem of minimizing the total weighted completion time in a proportionate flow shop is solvable in O (n 2 ) time. The proportionate flow shop model can be generalized by describing the processing time on each machine as a function of a processing requirement and a machine-dependent parameter, e.g., machine speed or other machine specific value.…”
Section: Literature Review and Preliminary Results
mentioning
confidence: 99%
“…Obviously, (1) and (2) imply that c N (σ i ) is minimal with respect to the s i + 1 considered orders. In Shakhlevich et al (1998), it is shown thatσ i = is optimal for the case in which jobs {i + 1, . .…”
Section: For Every R > R N (I)
mentioning
confidence: 86%
“…Earlier we mentioned the practical significance of the property in formula (4). Shakhlevich et al [64] credited Pinedo (by referring to the 1995 edition of Pinedo [60]) as follows:…”
Section: Discussion
mentioning
confidence: 99%
