Habitat fragmentation is one of the principal causes of biodiversity loss and hence understanding its impacts on community assembly and disassembly is an important topic in ecology. We studied the relationships between fragmentation and community assembly processes in the land-bridge island system of Thousand Island Lake in East China. We focused on the changes in species diversity and phylogen...

This paper presents an extended classification for non-permutation flowshops. The versatile options which occur with the possibility of resequencing jobs within the line are considered. The literature review shows that no classification exists which considers extensively this type of flowshop.

In this paper, we address the problem of two-machine flowshop scheduling problem with sequence independent setup times to minimize the total completion time. We propose five new polynomial lower bounds. Computational results based on randomly generated data show that our proposed lower bounds consistently outperform those of the literature.

We demonstrate sequential assembly of chemically patchy colloids such that their valence differs from stage to stage to produce hierarchical structures. For proof of concept, we employ ACB triblock spheres suspended in water, with the C middle band electrostatically repulsive. In the first assembly stage, only A-A hydrophobic attraction contributes, and discrete clusters form. They can be store...

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...

The paper assumes a product design around modular architectures and discusses the suitability of the principle of delayed product differentiation in assemble-to-order environments. We demonstrate that this principle does not enable one to make optimal decisions concerning how variety should proliferate in the assembly process. Therefore, we propose to complement this principle in that we additi...

This paper deals with the permutation flowshop scheduling problem time lags constraints to minimize total weighted tardiness criterion by using Branch and Bound algorithm. A new lower bound was developed for problem. The computational experiments indicate that proposed algorithm provides good solution in terms of quality requirements.