6533b834fe1ef96bd129cd7b

RESEARCH PRODUCT

Two Job Cyclic Scheduling with Incompatibility Constraints

Raffaele PesentiWalter UkovichPiero Persi

subject

Rate-monotonic schedulingMathematical optimizationJob shop schedulingComputer scienceStrategy and ManagementDistributed computingFlow shop schedulingDynamic priority schedulingManagement Science and Operations ResearchFair-share schedulingMultiprocessor schedulingComputer Science ApplicationsNurse scheduling problemManagement of Technology and InnovationTwo-level schedulingBusiness and International ManagementComputer Science::Operating Systems

description

The present paper deals with the problem of scheduling several repeated occurrences of two jobs over a finite or infinite time horizon in order to maximize the yielded profit. The constraints of the problem are the incompatibilities between some pairs of tasks which require a same resource.

http://hdl.handle.net/11368/1695785