An Exact Solution Algorithm for a Class of Production Planning and Scheduling Problems
| Autor: | Manu S. Madan, K. C. Gilbert |
|---|---|
| Rok vydání: | 1992 |
| Předmět: |
Marketing
Operations research Computational complexity theory business.industry Computer science Strategy and Management Scheduling (production processes) Holding cost Time horizon Transportation theory Management Science and Operations Research Management Information Systems Scheduling (computing) Production planning Production control Project management business Algorithm |
| Zdroj: | Journal of the Operational Research Society. 43:961-970 |
| ISSN: | 1476-9360 0160-5682 |
| DOI: | 10.1057/jors.1992.147 |
| Popis: | This paper presents a formulation and an exact solution algorithm for a class of production planning and scheduling problems. The problem is one of optimally specifying production levels for each product in each period of the planning horizon. The objective is to minimize the sum of the set-up, regular time production, overtime and inventory holding costs. The problem has been formulated as a variation of fixed charge transportation problem. The problem discussed here is NP-hard in computational complexity. A numerical example is presented for better understanding of the algorithm. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink