Search Results for author:
Found 3 papers, 0 papers with code
Hybrid ASP-based multi-objective scheduling of semiconductor manufacturing processes (Extended version)
Modern semiconductor manufacturing involves intricate production processes consisting of hundreds of operations, which can take several months from lot release to completion.
Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
The Job-shop Scheduling Problem (JSP) is a well-known and challenging combinatorial optimization problem in which tasks sharing a machine are to be arranged in a sequence such that encompassing jobs can be completed as early as possible.
Solving a Multi-resource Partial-ordering Flexible Variant of the Job-shop Scheduling Problem with Hybrid ASP
In this paper, we consider a Multi-resource Partial-ordering Flexible Job-shop Scheduling (MPF-JSS) problem where partially-ordered sequences of operations must be scheduled on multiple required resources, such as tools and specialists.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
