نتایج جستجو برای: distributed permutation flow shops

تعداد نتایج: 753460  

Journal: :European Journal of Combinatorics 2022

Permutation statistics wm¯ and rlm are both arising from permutation tableaux. was introduced by Chen Zhou, which proved equally distributed with the number of unrestricted rows a tableau. While is shown Nadeau 1’s in first row In this paper, we investigate joint distribution rlm. Statistic (rlm, wm¯, rlmin, des, (321)) on Sn. Then generating function wm¯) follows. An involution constructed to ...

Journal: :Oryx 1971

2012
N. Karimi M. Zandieh A. A. Najafi

Group scheduling in flexible flow shops: a hybridised approach of imperialist competitive algorithm and electromagnetic-like mechanism N. Karimi a , M. Zandieh b & A.A. Najafi c a Faculty of Industrial and Mechanical Engineering, Qazvin Islamic Azad University, Qazvin, Iran b Department of Industrial Management, Management and Accounting Faculty, Shahid Beheshti University, G.C., Tehran, Iran c...

Journal: :European Journal of Operational Research 1999
Peng Tian Jian Ma Dong-Mo Zhang

Focusing on the generation mechanism of random permutation solutions, this paper investigates the application of the Simulated Annealing (SA) algorithm to the combinatorial optimisation problems with permutation property. Six types of perturbation scheme for generating random permutation solutions are introduced. They are proved to satisfy the asymptotical convergence requirements. The results ...

2016
Giorgio Delzanno

We present a framework for the specification of distributed protocols based on a logic-based presentation of bipartite graphs. For the considered language, we define assertions that can be applied to arbitrary configurations. We apply the language to model the distributed version of the Dining Philosopher Protocol. The protocol is defined for asynchronous processes distributed over a graph with...

2014
Kazuko Morizawa

This paper proposes a heuristic algorithm, called list-based squeezing branch and bound algorithm, for solving a machine-fixed, machining-assembly flowshop scheduling problem to minimize makespan. The machine-fixed, machining-assembly flowshop consists of some parallel two-machine flow lines at a machining stage and one robot at an assembly stage. Since an optimal schedule for this problem is n...

2004
Stefan Kuhlins Bjørn-Henrik Zink

Imagine that the product data of every online shop would be machinereadable and you could find the best product offers in an instant. Many e-business scenarios, such as price comparers, electronic markets, product search engines, and shop directories require integration of distributed heterogeneous information systems. Information extraction from heterogeneous Web sites has been a research topi...

Journal: :International Journal of Modelling, Identification and Control 2019

2011
Glenn A. Metts Charles H. Apigian

Smaller production companies, such as job shops, are often incapable of committing significant human or capital resources for the improvement of manufacturing flow times. However, there is considerable demand in these organizations for solutions that offer improvements without the risk involved in expending these resources. This paper investigates the impact of scheduling rules and reorganizati...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید