A conceptual framework for designing pharmaceutical reverse logistics networks in China

Over latest decade, Reverse Logistics (RL) has gained more and more attention from both industry and academia. In the past, most research on RL has been focused on automobile, electronic waste, computer, paper, package and package material. There is very little research and practice on drug recycling. Nevertheless, it is vital important to properly dispose expired drug because of hazardous contain which may harm to people and environment. In China, public awareness of the harmfulness of expired drugs is still very low and very few efforts have been made to recycle drugs. Therefore, this research aims to build up a conceptual framework to indentify factors of influencing drug recycling in China, from scratch borrowing from existing literature and industry practices in other recycling areas. This framework helps in designing reverse logistic (RL) network and also can provide a useful reference tool for policymakers at the local and national level. Furthermore, a primary research is planed to validate the framework and RL network.

The open shop scheduling problem with a given sequence of jobs on one machine

The paper considers the open shop scheduling problem to minimize the make-span, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not allowed, the problem is NP-hard in the strong sense if the number of machines is variable, and is NP-hard in the ordinary sense in the case of two machines. For the latter case we give a heuristic algorithm that runs in linear time and produces a schedule with the makespan that is at most 5/4 times the optimal value. We also show that the two-machine problem in the nonpreemptive case is solvable in pseudopolynomial time by a dynamic programming algorithm, and that the algorithm can be converted into a fully polynomial approximation scheme. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 705–731, 1998

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is NP-hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst-case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two-machine flow shop and the open shop problems with a single server are also shown to be NP-hard in the strong sense. However, we reduce the two-machine flow shop no-wait problem with a single server to the Gilmore-Gomory traveling salesman problem and solve it in polynomial time. (c) 2000 John Wiley & Sons, Inc.

Two-machine flowshop scheduling problems with no-wait jobs

We study a two-machine flow shop scheduling problem with no-wait in process, in which one of the machines is not available during a specified time interval. We consider three scenarios of handing the operation affected by the nonavailability interval. Its processing may (i) start from scratch after the interval, or (ii) be resumed from the point of interruption, or (iii) be partially restarted after the interval. The objective is to minimize the makespan. We present an approximation algorithm that for all these scenarios delivers a worst-case ratio of 3/2. For the second scenario, we offer a 4/3-approximation algorithm.

Scheduling parallel dedicated machines with the speeding-up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two-machine problem is NP-hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst-case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple-choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008

Transporting jobs through a two-machine open shop

We consider the two-machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find the sequence of moves of the transporter so that the time by which the completed jobs are collected together on board the transporter is minimal. We present a 7/5-approximation algorithm. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009

ATR-FTIR spectroscopy and spectroscopic imaging of solvent and permeant diffusion across model membranes

The uptake and diffusion of solvents across polymer membranes is important in controlled drug delivery, effects on drug uptake into, for example, infusion bags and containers, as well as transport across protective clothing. Attenuated Total Reflectance Fourier Transform Infrared (ATR-FTIR) spectroscopy has been used to monitor the effects of different solvents on the diffusion of a model compound, 4-cyanophenol (CNP) across silicone membrane and on the equilibrium concentration of CNP obtained in the membrane following diffusion. ATR-FTIR spectroscopic imaging of membrane diffusion was used to gain an understanding of when the boundary conditions applied to Fick's second law, used to model the diffusion of permeants across the silicone membrane do not hold. The imaging experiments indicated that when the solvent was not taken up appreciably into the membrane, the presence of discrete solvent pools between the ATR crystal and the silicone membrane can affect the diffusion profile of the permeant. This effect is more significant if the permeant has a high solubility in the solvent. In contrast, solvents that are taken up into the membrane to a greater extent, or those where the solubility of the permeant in the vehicle is relatively low, were found to show a good fit to the diffusion model. As such these systems allow the ATR-FTIR spectroscopic approach to give mechanistic insight into how the particular solvents enhance permeation. The solubility of CNP in the solvent and the uptake of the solvent into the membrane were found to be important influences on the equilibrium concentration of the permeant obtained in the membrane following diffusion. In general, solvents which were taken up to a significant extent into the membrane and which caused the membrane to swell increased the diffusion coefficient of the permeant in the membrane though other factors such as solvent viscosity may also be important.

Caking strength of granulated clay under frozen conditions

Transport of particulate clay occurs during some extremely cold weather conditions typically in the winter in the far North area. During the transport and temporary storage time, the clay may cake inside a rail or road wagon or in a silo, and consequently be difficult to be discharged from the containers. This paper studied caking strength of a granulated clay powder with a certain water moisture content of 18% for influences of temperature, packing stress and freezing time. The temperature tested was -5 oC, -10 oC and -20 oC. Because the clay powder may be packed at different bed depth, the study was undertaken across the packing stress range at 8.3 kPa (1 m bed depth), 25.0 kPa (3 m) and 75.0 kPa (9 m). Freezing time varied between 4 hours (transport) and 18 hours (overnight). During the tests, failure of caked materials was measured using a QTS texture analyzer and the caking strength of frozen samples was calculated. Influences on freeze caking of granular clay in storage or transport are discussed briefly. Some conclusions are made at the end of the paper,including recommendations for practical methods for mitigating these problems.