Production scheduling is the process of allocating the resources and then sequencing of task to produce goods. Allocation and sequencing decision are closely related and it is very difficult to model mathematical interaction between them. The allocation problem is solved first and its results are supplied as inputs to the sequencing problem. High quality scheduling improves the delivery perform...

in this research, samples were collected from three iranian native dogs and three wolves. whole-genome sequencing for each individual was performed using next-generation sequencing technology. all short reads were aligned to the reference genome using bwa tool. single-nucleotide polymorphisms (snps) and small insertions and deletions (indels) were detected using the genome analysis toolkit (gat...

In this paper, the problem of sequencing machines in the final assembly line with regard to the supply of parts has been investigated. For this reason, a basic integer linear programming model has been developed and based on this, the problem-solving algorithm is developed in accordance with the reaction-based approach based on the renewal of the sequence of operations. Also, due to the Np-hard...

The problem of determining the sequence of a set of jobs with the objective function of minimizing the maximum earliness and tardiness in one machine is studied. &#10 Production systems like JIT are one of the many applications of the problem. This problem is studied in special cases and their optimal solutions are introduced with simple orders. In general, some effective conditions for ne...

This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, mult...

In this paper a one-machine scheduling model is analysed where n diierent jobs are classiied into K groups depending on which additional resource they require. The changeover time from one job to another consists of the removal or the setup time of the two jobs and is sequence-dependent in the sense that the changeover time is determined by whether or not the two jobs belong to the same group. ...