A heuristic approach for determining lot sizes and schedules using power-of-two policy (Q933870)
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 5304389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic approach for determining lot sizes and schedules using power-of-two policy |
scientific article; zbMATH DE number 5304389 |
Statements
A heuristic approach for determining lot sizes and schedules using power-of-two policy (English)
0 references
28 July 2008
0 references
Summary: We consider the problem of determining realistic and easy-to-schedule lot sizes in a multiproduct, multistage manufacturing environment. We concentrate on a specific type of production, namely, flow shop type production. The model developed consists of two parts, lot sizing problem and scheduling problem. In lot sizing problem, we employ binary integer programming and determine reorder intervals for each product using power-of-two policy. In the second part, using the results obtained of the lot sizing problem, we employ mixed integer programming to determine schedules for a multiproduct, multistage case with multiple machines in each stage. Finally, we provide a numerical example and compare the results with similar methods found in practice.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8559534549713135
0 references
0.8127670288085938
0 references
0.7899051904678345
0 references
0.7758933901786804
0 references
0.7751017212867737
0 references
