A fast computational procedure to solve the multi-item single machine lot scheduling optimization problem: The average cost case (Q2757647)
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 fast computational procedure to solve the multi-item single machine lot scheduling optimization problem: The average cost case |
scientific article; zbMATH DE number 1677144
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast computational procedure to solve the multi-item single machine lot scheduling optimization problem: The average cost case |
scientific article; zbMATH DE number 1677144 |
Statements
26 November 2001
0 references
scheduling problems
0 references
quasi-variational inequalities
0 references
Bellman equation
0 references
viscosity solution
0 references
average cost
0 references
numerical solution
0 references
A fast computational procedure to solve the multi-item single machine lot scheduling optimization problem: The average cost case (English)
0 references
0.885002851486206
0 references
0.8347208499908447
0 references
0.744947612285614
0 references