In this talk, we consider parameterised versions of the jobshop scheduling problem where a parameterised number of jobs have to complete a sequence of actions some of which are mutually exclusive. The cost of completing the jobs is the total time the jobs spend. We show that in the some cases the parameterised cost function is semilinear and can be computed by using Petri Net techniques.