Thrombocytopenia induced by a taurine-containing energy drink: an adverse reaction to herbal medicine

Thrombocytopenia is a well-recognized adverse effect of many drugs. The association of thrombocytopenia with herbal remedies, nutritional supplements, foods and beverages, complementary or alternative medicines, has been rarely described. There are reports of thrombocytopenia caused by quinine-containing beverages, cow�s milk, cranberry juice, Jui, a Chinese herbal tea, Lupinus termis bean and tahini. A definite evidence of a causal association with thrombocytopenia is warranted; nevertheless not always there is provided probable or possible evidence in the association with thrombocytopenia. We report the first case, to our knowledge, of thrombocytopenia induced by taurine, present in an energy drink prescribed to our patient as tonic treatment

Iterated tabu search for the car sequencing problem

This paper introduces an iterated tabu search heuristic for the daily car sequencing problem in which a set of cars must be sequenced so as to satisfy requirements from the paint shop and the assembly line. The iterated tabu search heuristic combines a classical tabu search with perturbation operators that help escape from local optima. The resulting heuristic is flexible, easy to implement, and fast. It has produced very good results on a set of test instances provided by the French car manufacturer Renault.

Iterated tabu search for the car sequencing problem

This paper introduces an iterated tabu search heuristic for the daily car sequencing problem in which a set of cars must be sequenced so as to satisfy requirements from the paint shop and the assembly line. The iterated tabu search heuristic combines a classical tabu search with perturbation operators that help escape from local optima. The resulting heuristic is flexible, easy to implement, and fast. It has produced very good results on a set of test instances provided by the French car manufacturer Renault

A DYNAMIC GAME OF OPERATIONS AND MARKETING MANAGEMENT IN A SUPPLY CHAIN

The aim of the paper is to study some important differences between (classical) non-cooperative and (modern) cooperative supply chain management. For this purpose, the paper develops a differential game model involving operations and marketing activities that are performed by a manufacturer and a retailer in a simple two-member supply chain. We consider a particular single brand of the manufacturer. The manufacturer decides on production volume, production process improvement and national advertising efforts, while the retailer decides her purchase volume by the manufacturer and her pricing policy toward the final consumers. A revenue sharing contract is employed in the non-cooperative setting. Among the issues addressed on the manufacturer side are the trade-off between production and process improvement activities, the path of inventory over time, and the trade-off between attracting new customers and improving the loyalty of current customers. For the retailer we study the inventory and price evolution over time.Supply chain management, operations, marketing, revenue sharing contract, dynamic games

An iterated local search heuristic for the logistics network design problem with single assignment

In the logistics network design problem (LNDP), decisions must be made regarding the selection of suppliers, the location of plants and warehouses, the assignment of activities to these facilities, and the flows of raw materials and finished products in the network. This article introduces an iterated local search (ILS) heuristic for the LNDP variant arising when each raw material should be supplied by a unique supplier, and each finished product should be produced and distributed by a unique plant and a unique warehouse, respectively. The ILS heuristic exploits the combinatorial nature of the problem and relies on simple moves combined within a descent algorithm. Several perturbation operators are used to allow a broad exploration of the solution space. The performance of the algorithm is evaluated on randomly generated instances, and the solutions are compared with lower bounds computed by solving the LP relaxation of the problem.

An Iterated Local Search Heuristic for the Logistics Network Design Problem with Single Assignment

In the logistics network design problem (LNDP), decisions must be made regarding the selection of suppliers, the location of plants and warehouses, the assignment of activities to these facilities, and the flows of raw materials and finished products in the network. This article introduces an iterated local search (ILS) heuristic for the LNDP variant arising when each raw material should be supplied by a unique supplier, and each finished product should be produced and distributed by a unique plant and a unique warehouse, respectively. The ILS heuristic exploits the combinatorial nature of the problem and relies on simple moves combined within a descent algorithm. Several perturbation operators are used to allow a broad exploration of the solution space. The performance of the algorithm is evaluated on randomly generated instances, and the solutions are compared with lower bounds computed by solving the LP relaxation of the problem