the aim of this study was to develop a derivative of chitosan as pharmaceutical excipient used in sustained-release matrix tablets of poorly soluble drugs. a water-soluble quaternary ammonium carboxymethylchitosan was synthesized by a two-step reaction with carboxymethylchitosan (cmcts), decylalkyl dimethyl ammonium and epichlorohydrin. the elemental analysis showed that the target product with...

Despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. This paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (MIP) models to solve thisproblem. These models have been formulated for the classical single machine problem, namely sequ...

In this paper we consider the single machine scheduling problem with integer release dates and the objective of minimising the sum of deviations of jobs’ completion times from a common integer due date. We present an efficient polynomial algorithm for the unit processing time case. We also show how to calculate in polynomial time the minimum non-restrictive due date for the general case.

Most women undergoing first-trimester abortion are healthy. However, abortion providers also encounter women with a wide variety of medical conditions, some of which are serious and complex. When such a condition exists, consultation with the woman's physician or a specialist can facilitate decision making regarding hospital referral and additional preparations that may be required. Medical con...

Date Author Summary of chanes 10/02/2002 Marius Bozga, Sergey Olvovsky IFE with test directives 1st release

We have n jobs with release times and due-dates to be scheduled on a single-machine that can handle at most one job at a time. Our objective is to minimize the number of late jobs, ones completed after their due-dates. This problem is known to be solvable in time O(n4). We show that the special case of the problem when job processing times and due-dates are tied so that for each pair of jobs i,...

This paper describes a hybrid grouping genetic algorithm for a multiprocessor scheduling problem, where a list of tasks has to be scheduled on identical parallel processors. Each task in the list is defined by a release date, a due date and a processing time. The objective is to minimize the number of processors used while respecting the constraints imposed by release dates and due dates. We ha...

Software reliability modeling and prediction are important issues during software development, especially when one has to reach a desired reliability prior to software release. Various techniques, both static and dynamic, are used for reliability modeling and prediction in the context of software risk management. The single-phase Rayleigh model is a dynamic reliability model; however, it is not...

Discussion in the Efficacy Working Party February 2001 / October 2001 Transmission to CPMP November 2001 Release for consultation November 2001 Deadline for comments May 2002 Discussion in the Efficacy Working Party September/October 2002 Transmission to CPMP December 2002 Adoption by CPMP December 2002 Date for coming into operation June 2003 Draft Rev. 1 agreed by Urology Drafting Group Octob...

In this paper, we present an approach to deal with fuzzy constraints in a flow shop problem. The flexible constraints on job release date and due date, as well as job processing time are described by fuzzy sets. We propose a method to calculate the satisfaction degree of the schedule with respect to fuzzy release dates and fuzzy due dates of jobs. The objective is to obtain a schedule which has...