An Exact Solution Algorithm for a Class of Production Planning and Scheduling Problems

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, regu...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:The Journal of the Operational Research Society Ročník 43; číslo 10; s. 961 - 970
Hlavní autoři: Madan, M. S., Gilbert, K. C.
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Taylor & Francis 01.10.1992
Macmillan Press
Palgrave Macmillan UK
Palgrave
Pergamon Press
Taylor & Francis Ltd
Témata:
Algorithms
Applied sciences
Business and Management
Capital costs
Carrying costs
Cost efficiency
Exact sciences and technology
Incumbents
Inventory control, production control. Distribution
Management
Mathematical models
Operational research and scientific management
Operational research. Management science
Operations research
Operations Research/Decision Theory
Optimal solutions
Production capacity
Production costs
Production Planning
Production scheduling
Scheduling
Studies
Theoretical Paper
Theoretical Papers
Transportation
Production Planning
Transportation problem
Production control
NP hard problem
Fixed charge problem
Scheduling
Planning
Algorithm
Optimization
ISSN:0160-5682, 1476-9360
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
content type line 23
ISSN:0160-5682
1476-9360
DOI:10.1057/jors.1992.147