Search Results for author:
Found 2 papers, 0 papers with code
Exact and heuristic methods for the discrete parallel machine scheduling location problem
The discrete parallel machine makespan scheduling location (ScheLoc) problem is an integrated combinatorial optimization problem that combines facility location and job scheduling.
A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
We consider single/parallel machine E-T problems that may or may not consider some additional features such as idle time, setup times and release dates.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
