Abstract Marijuana (Cannabis sativa) is an important annual medicinal plant that belongs to the Cannabaceae family. It contains 421 substances of 18 chemical types-the most significant compound is δ-9-tetrahydrocannabinol, which causes several effects, both in the Central Nervous System and in several peripheral locations in the organism. The objectives of this scientific review are to mention the anatomical distribution, chemical characteristics and biosynthesis of cannabinoids, as well as its actions mechanisms. The endogenous cannabinoid system, the therapeutic properties of C. sativa and its action on the nociceptive control are described. Finally, the modulators of the cannabinoid system in clinical use are indicated, together with marijuana legalization benefits.

Na mineração subterrânea, diariamente, uma frota de veículo LHD (load-haul-dump) deve ser alocada à rede de galerias para extrair o minério segundo um plano estratégico de trabalho. Esse plano é definido pela alta gerência e contém o número de cargas a serem extraídas desde os pontos de remoção de uma dada galeria para cada turno de trabalho. Nesse trabalho, formula-se um modelo de programação inteira (PI), para minimizar o makespan de uma galeria de trabalho, e propõe-se um algoritmo ótimo em tempo polinomial, para a sua resolução. Em seguida, obtém-se um conjunto de regras de decisão, a partir do algoritmo proposto, o qual é integrado a um processo de tomada de decisão (PTD). Esse PTD é de simples execução para os operadores de LHDs, determina o makespan ótimo e, se existe a possibilidade de conclusão dentro do turno de trabalho. Finalmente, realiza-se uma análise comparativa entre o PTD proposto e àquele utilizado na mina chilena subterrânea de cobre El Teniente. Os resultados mostram que a experiência acumulada dos operadores converge para soluções próximas ao makespan ótimo.

In underground mining, daily a fleet of LHDs must be allocated to a haulage network of drifts for extracting ore according to a plan-driven strategy. This plan is hierarchically decided by a higher management level and it contains the number of ore bucketfuls to be extracted from each drawpoint within a drift for each working shift. In this paper, an integer programming (IP) model for minimizing the makespan of drift workload is formulated and a polynomial time optimal algorithm for its resolution is proposed. Next, a set of decision rules obtained from the algorithm above is integrated into the decision-making process (DMP). This DMP is simple to execute for LHD operators, determines the optimal makespan, and whether or not it can be carried out in the working shift. Finally, a comparative analysis between the DMP proposed and the DMP used in El Teniente copper underground Chilean mine is studied. The results show that the cumulative operators experience has converged to solutions near to optimal makespan.