In this paper we propose a novel continuous time model based on state task network for the problem of scheduling m products in n continuous processing units with simultaneous arrival of liquid inputs and multiple intermediate upliftment dates. The units can process only one product line at a time and are buffered by fixed capacity storage tanks. An optimization model for the problem tries to ba...

BACKGROUND One of the national mortality databases in the U.S. is the Beneficiary Identification and Record Locator Subsystem (BIRLS) Death File that contains death dates of those who have received any benefits from the Department of Veterans Affairs (VA). The completeness of this database was shown to vary widely from cohort to cohort in previous studies. Three other sources of death dates are...

encouraging natural enemies by growing attractive plants is considered an effective method of pest control in organic farming. however, it is important to identify which flowers best attract beneficial insects. in this study, relative attractiveness of 16 species of flowering plants to adult hoverflies was assessed by conducting timed observations of feeding-visit frequencies. the experiments w...

Tip-dating methods are becoming popular alternatives to traditional node calibration approaches for building time-scaled phylogenetic trees, but questions remain about their application to empirical datasets. We compared the performance of the most popular methods against a dated tree of fossil Canidae derived from . CC-BY-NC-ND 4.0 International license peer-reviewed) is the author/funder. It ...

abstract: this paper considers the problem of scheduling n jobs on m unrelated parallel machines with sequence-dependent setup times. to better comply with industrial situations, jobs have varying due dates and ready times and there are some precedence relations between them. furthermore sequence-dependent setup times and anticipatory setups are included in the proposed model. the objective is ...

We consider the class of single machine scheduling problems with the objective to minimize the weighted number of late jobs, under the assumption that completion due-dates are not known precisely at the time when decisionmaker must provide a schedule. It is assumed that only the intervals to which the due-dates belong are known. The concept of maximum regret is used to define robust solution. A...

Coordinating due dates of operations throughout all stages of manufacturing and assembly is a problem especially for complex product structures with uncertainties in process times. A recursive procedure is described to estimate distributions of completion times for each operation. Stage due dates are then calculated to meet speci® ed service targets. Compared with plans from existing heuristic ...

This paper researches on a special job-shop scheduling problem meeting capabilities of equipments and different due-dates. Its model is developed, which can accord process capacity and different due-dates in numerous jobs to select some to process, and the objective is as far as possible to maximize output. In order to solve complex scheduling problems proposed in this paper, a discrete particl...