Title: Configurable Scheduling Solution using Flexible Heuristics
Abstract: This paper presents a scheduling solution that is based on heuristics. It highlights the flexibility that a simple heuristic method offers and shows that using the ISA-95 standard it is possible to specify the most relevant problem requirements. It also compares the solution quality of a smaller scale problem to a rigorous mixed-integer linear programming (MILP) approach and shows how a heuristic approach scales towards large-size industrial problems. The paper concludes with a discussion of the advantages and disadvantages of both approaches, showing that for certain types of problems, the heuristic approach is fully sufficient.
Publication Year: 2016
Publication Date: 2016-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot