Single item lot-sizing problems with backlogging on a single machine at a finite production rate |
| |
| Institution: | 1. Department of Computer Science and Engineering, Nanjing University of Science and Technology, China;2. Department of Computer Science, Norwegian University of Science and Technology, 2815 Gjvik, Norway;3. Faculty of Information Technology, Macau University of Science and Technology, Macao;4. School of Information Science and Engineering, Qufu Normal University, China;1. Universidad Autonoma Metropolitana, Departamento de Energía Av. San Pablo 180, C.P. 02200 CDMX, México;2. Tecnologico de Monterrey, Escuela de Ingeniería y Ciencias Av. Eugenio Garza Sada 2501, Monterrey, N.L., 64849, Mexico |
| |
| Abstract: | In this paper we consider a single item lot-sizing problem with backlogging on a single machine at a finite production rate. The objective is to minimize the total cost of setup, stockholding and backlogging to satisfy a sequence of discrete demands. Both varying demands over a finite planning horizon and fixed demands at regular intervals over an infinite planning horizon are considered. We have characterized the structure of an optimal production schedule for both cases. As a consequence of this characterization, a dynamic programming algorithm is proposed for the computation of an optimal production schedule for the varying demands case and a simpler one for the fixed demands case. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
