We consider the parallel machine scheduling problem,minimizing the makespan,where jobs arrive over time,(Ⅰ)on two uniform machines with speeds 1 and s≥1,a
We consider the problem of scheduling n deteriorating jobs with release dates on a single batching machine.Each job is either accepted and processed in batc
We consider the online bounded-batch scheduling to minimize total weighted completion time on parallel machines.In the problem,a set of n independent jobs a
We study two models of scheduling games: load-balancing games with and without activation costs,where every job corresponds to a self-interested player who
This paper deals with the robotic jobshop rescheduling problem with reentrant and parallel machines,where a part may visit some processing machines more tha