Name
Abstract | ||
|---|---|---|
Consider the Product Rate Variation problem. Given n products 1,…,i,…,n, and n positive integer demands d1,…, di,…,dn. Find a sequence α=α1,…,αT, T=\sumi=1ndi, of the products, where product i occurs exactly di times that always keeps the actual production level, equal the number of product i occurrences in the prefix α1,…, αt, t=1,…,T, and the desired production level, equal rit, where ri=di/T, of each product i as close to each other as possible. The problem is one of the most fundamental problems in sequencing flexible just-in-time production systems. We show that if β is an optimal sequence for d1,…,di,…,dn, then concatenation βm of m copies of β is an optimal sequence for md1,…, mdi,…,mdn. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1023/A:1024847308982 | J. Global Optimization |
Keywords | Field | DocType |
Optimization,assignment problem,apportionment problem,convex functions,just-in-time systems | Integer,Combinatorics,Mathematical optimization,Prefix,Convex function,Assignment problem,Concatenation,Mathematics | Journal |
Volume | Issue | ISSN |
27 | 2-3 | 1573-2916 |
Citations | PageRank | References |
4 | 0.60 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wieslaw Kubiak | 1 | 540 | 62.61 |