Advanced planning and scheduling technology

This article presents research on the core technology in advanced planning and scheduling (APS) systems that are currently the state-of-art in supply chain planning and optimisation. Further research is needed to enable the opportunities given, especially the area of combined planning and scheduling...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Production planning & control Ročník 22; číslo 8; s. 800 - 808
Hlavní autoři: Steger-Jensen, Kenn, Hvolby, Hans-Henrik, Nielsen, Peter, Nielsen, Izabela
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Taylor & Francis Group 01.12.2011
Taylor & Francis LLC
Témata:
ISSN:0953-7287, 1366-5871
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 article presents research on the core technology in advanced planning and scheduling (APS) systems that are currently the state-of-art in supply chain planning and optimisation. Further research is needed to enable the opportunities given, especially the area of combined planning and scheduling. Mixed integer linear programming (MILP) methods have been successfully applied to solve diverse problems, such as planning and capital budgeting. Constraint programming (CP) methods have proved to be successful in solving highly constrained discrete optimisation and feasibility problems for scheduling and resource allocation and have been combined with MILP and titled Mixed linear logic programming (MLLP). In this article an integrated approach is presented that uses the complementary strengths of MILP and CP for solving problems that are otherwise intractable using either of these two methods alone. The presented optimisation approach can effectively handle the combined planning and scheduling problem within an APS system as part of the core optimisation engine.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0953-7287
1366-5871
DOI:10.1080/09537287.2010.543563