Estimation of the Largest and the Smallest Function Values of a Feasible Solution for the Total Product Rate Variation Problem
2015 ◽
Vol 19
(1)
◽
pp. 35-38
Keyword(s):
The problem of minimizing the total deviations between the actual and the ideal cumulative production of a variety of models of a common base product arises as a sequencing problem in mixed-model just-in-time production systems. This is called the total product rate variation problem. Several pseudo-polynomial exact algorithms and heuristics have been derived for this problem. In this paper, we estimate the largest and the smallest function values of a feasible solution for the problem when the m-th power of the total deviations between the actual and the ideal cumulative productions has to be minimizedJournal of Institute of Science and Technology, 2014, 19(1): 35-38
2020 ◽
Vol 37
(1-2)
◽
pp. 47-54
Keyword(s):
AN efficient algorithm for the bottleneck product rate variation problem with precedence constraints
1970 ◽
Vol 7
(1)
◽
pp. 63-73
Keyword(s):
1994 ◽
Vol 16
(5)
◽
pp. 299-301
◽
1993 ◽
Vol 13
(1)
◽
pp. 27-36
◽
1989 ◽
Vol 27
(9)
◽
pp. 1487-1509
◽
2001 ◽
Vol 131
(1)
◽
pp. 188-207
◽
Keyword(s):
2009 ◽
Vol 197
(2)
◽
pp. 818-824
◽
Keyword(s):
1990 ◽
Vol 9
(3)
◽
pp. 371-390
◽
Keyword(s):
1994 ◽
Vol 27
(1-4)
◽
pp. 225-228
◽
Keyword(s):
1993 ◽
Vol 11
(1)
◽
pp. 45-50
◽
Keyword(s):