Network Programming Models for Production Scheduling in Multi-Stage, Multi-Item Capacitated Systems (Q3716787)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3945852
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Network Programming Models for Production Scheduling in Multi-Stage, Multi-Item Capacitated Systems |
scientific article; zbMATH DE number 3945852 |
Statements
Network Programming Models for Production Scheduling in Multi-Stage, Multi-Item Capacitated Systems (English)
0 references
1984
0 references
production and inventory constraints
0 references
heuristic
0 references
capacitated minimal cost network problem
0 references
0.7869067788124084
0 references
0.7852741479873657
0 references
0.779651939868927
0 references
The paper considers an N-item, M-stage production scheduling problem, in which during T time periods each of N items passes through the same set of production stages (levels) in the same sequence. A mathematical formulation of the problem is given, involving among other parameters production and inventory holding costs, external demand, total production and inventory capacities, which leads to a linear minimization problem under equality and inequality constraints. The authors suggest a heuristic for a special case of this problem in which bundle constraints on inventory and/or production occur at only one level. If there is a constraint on both production and inventory it is required that the coefficient for a product in both constraints be the same, except for a scale factor which is constant for all periods. It is established that the special case described above is a capacitated minimal cost network problem when \(T=3\). In this case the problem can be solved exactly using one of the known efficient network algorithms. The heuristic algorithm for a longer problem \((T>3)\) proceeds by dividing the period into three-period ''blocks''. Each of them is solved by application of the network algorithm.
0 references