Solving the capacitated lot-sizing problem with backorder consideration
| Autor: | Manu S. Madan, Sam So, Yash P. Gupta, Chun Hung Cheng |
|---|---|
| Rok vydání: | 2001 |
| Předmět: |
Marketing
Operations research Computer science business.industry Strategy and Management Production cost Scheduling (production processes) Holding cost Overtime Transportation theory Management Science and Operations Research Upper and lower bounds Sizing Purchasing Management Information Systems Project management business |
| Zdroj: | Journal of the Operational Research Society. 52:952-959 |
| ISSN: | 1476-9360 0160-5682 |
| Popis: | In this research, we formulate and solve a type of the capacitated lot-sizing problem. We present a general model for the lot-sizing problem with backorder options, that can take into consideration various types of production capacities such as regular time, overtime and subcontracting. The objective is to determine lot sizes that will minimize the sum of setup costs, holding cost, backorder cost, regular time production costs, and overtime production costs, subject to resource constraints. Most existing formulations for the problem consider the special case of the problem where a single source of production capacity is considered. However, allowing for the use of alternate capacities such as overtime is quite common in many manufacturing settings. Hence, we provide a formulation that includes consideration of multiple sources of production capacity. We develop a heuristic based on the special structure of fixed charge transportation problem. The performance of our algorithm is evaluated by comparing the heuristic solution value to lower bound value. Extensive computational results are presented. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink