The dynamic lot-sizing problem with startup and reservation costs
Operations Research
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Scheduling Algorithms
| Hi-index | 0.00 |
The problems of M-machine, J-product, N-time point preemptive scheduling in parallel and serial production systems are the focus of this paper. The objective is to minimize the sum of the costs related to inventory level and production rate along a planning horizon. Although the problem is NP-hard, the application of the maximum principle reduces it into a well-tractable type of the two-point boundary value problem. As a result, algorithms of O(NMJk(N-L)+1) and O(N(MJ)k(N-L)+1) time complexities are developed for parallel and serial production systems, respectively, where L is the time point when the demand starts and k is the ratio of backlog cost MN over the inventory cost. This compares favorably with the time complexity O((J+1MN) of a naive enumeration algorithm.