E. Tresoldi

The Capacitated Scheduling Problem with Conflicts Jobs (CSPCJ) requires to find a feasible schedule, on a set of parallel identical machine without preemption, that maximizes the total weighted value of jobs completed before a common deadline. The schedule is subject to conflict constraints limiting the set of jobs that can be processed concurrently. In this work we present a new arc-flow inspired mathematical formulation and a three-step heuristic algorithm combining randomization, greedy construction and local search improvement for the CSPCJ. The effectiveness of our approaches is tested through extensive computational experiments. The results demonstrate that our formulation outperforms existing models proposed in the literature and that our simple heuristic algorithm is able to find very good solutions in limited computational time.

Keywords: Scheduling, Parallel Machines, Conflicts, Arc-flow


TD1 Scheduling 3
June 10, 2021  2:45 PM
1 - GB Dantzig

Latest news

  • 6/5/21
    Conference abstract book

Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.