In this work, we consider a scheduling problem faced by production companies with large electricity consumption.
In this paper, we consider a scheduling problem for divisible loads originating from single or multiple sites on arbitrary networks.
Thus, in this study, we consider a scheduling problem for a tire mixing process and suggest an efficient particle swarm optimization (PSO) algorithm for minimizing makespan.
We consider a scheduling problem where a set of jobs are simultaneously available for processing in a no-wait two-machine flowshop.
We consider a scheduling problem that arises in the context of surveillance or reconnaissance missions by multiple unmanned aerial vehicles (UAVs) where human operators would be present to perform tasks that require a high level of expertise and reasoning.
Here, we consider a scheduling algorithm for MU-MIMO mode where eNB selects the second UE in each group of allocatable RBs whose requested precoder is 180° out of phase from the precoder of the first UE to be served on the same RBs, that is, the precoder matrix is given as.
III, we consider a geometric scheduling strategy for the multi-user MIMO mode in LTE and propose a low-complexity interference-aware receiver structure.
In this paper, we consider a class of scheduling problems that we term Maximum Weighted -Valid Matching Problems (MWKVMP s).
In this paper we consider a labor constrained scheduling problem (LCSP) which is a simplification of a practical problem arising in industry.
We consider a hard decentralized scheduling problem with heterogeneous machines and competing job sets that belong to different self-interested stakeholders (agents).
