A dynamic production planning and scheduling algorithm for two products processed on one line (Q799234)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A dynamic production planning and scheduling algorithm for two products processed on one line |
scientific article; zbMATH DE number 3873051
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dynamic production planning and scheduling algorithm for two products processed on one line |
scientific article; zbMATH DE number 3873051 |
Statements
A dynamic production planning and scheduling algorithm for two products processed on one line (English)
0 references
1984
0 references
The paper presents an algorithm for solving a nonlinear binary program for scheduling two products on one machine or line with time-varying deterministic demand. Production rates are assumed fixed and restrictions are placed on inventory levels and production run lengths. The problem objective is to maximize total revenue of both products during a finite planning horizon. The algorithm uses an implicit enumeration strategy that, as follows from the author' tests, seems to be very efficient.
0 references
dynamic production planning
0 references
nonlinear binary program
0 references
scheduling
0 references
two products
0 references
one machine
0 references
time-varying deterministic demand
0 references
total revenue
0 references
finite planning horizon
0 references
implicit enumeration
0 references
0 references
0 references
0 references
0 references
0.85642505
0 references
0.8542805
0 references
0.85296994
0 references
0.8525426
0 references
0 references
0.8447608
0 references
0.8434749
0 references
0.84062755
0 references
