نتایج جستجو برای: akers graphical algorithm

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

Journal: :journal of industrial engineering, international 2009
m.t taghavi-fard h.r dehnar saidy

in this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. this study seems utterly new and it is applicable to any performance measure based on the completion time. the in...

2013
JOSÉ FERNANDO GONÇALVES

This paper presents a local search, based on a new neighborhood for the job-shop scheduling problem, and its application within a biased random-key genetic algorithm. Schedules are constructed by decoding the chromosome supplied by the genetic algorithm with a procedure that generates active schedules. After an initial schedule is obtained, a local search heuristic, based on an extension of the...

Journal: :ITOR 2014
José Fernando Gonçalves Mauricio G. C. Resende

This paper presents a local search, based on a new neighborhood for the job-shop scheduling problem, and its application within a biased random-key genetic algorithm. Schedules are constructed by decoding the chromosome supplied by the genetic algorithm with a procedure that generates active schedules. After an initial schedule is obtained, a local search heuristic, based on an extension of the...

2010
Hiroyuki Michinishi Tokumi Yokohira Takuji Okamoto

In this paper, we prove that Akers' test generation algorithm for the locally exhaustive testing gives a minimum test set (MLTS) for every combinational circuit (CUT) with up to four outputs. That is, we clanfi that Akers' test pattern generator can generate an MLTS for such CUT.

2006
Yann Hendel Francis Sourd

We use the Akers-Friedman geometric approach to solve the two jobs job-shop problem when there is an earliness cost on the first operation and a tardiness cost on the last operation of each job. We then generalize the problem by imposing earliness and tardiness costs on each operation and finally, we solve it using a dynamic programming algorithm. KeywordsEarliness-tardiness scheduling, Polyn...

Journal: :Digital Literature Review 2019

Journal: :Biographical Memoirs of Fellows of the Royal Society 1955

Journal: :Microelectronics Journal 2014
Yifat Levy Jehoshua Bruck Yuval Cassuto Eby G. Friedman Avinoam Kolodny Eitan Yaakobi Shahar Kvatinsky

In-memory computation is one of the most promising features of memristive memory arrays. In this paper, we propose an array architecture that supports in-memory computation based on a logic array first proposed in 1972 by Sheldon Akers. The Akers logic array satisfies this objective since this array can realize any Boolean function, including bit sorting. We present a hardware version of a modi...

Journal: :Journal of Animal and Feed Sciences 2023

1. Akers R.M. (Editor), 2002. Lactation and the mammary gland. 1st Edition. Wiley-Blackwell. Hoboken, NJ (USA) Google Scholar

Journal: :CoRR 2016
P. P. Chougule Bibhash Sen Tukaram D. Dongale

The present manuscript deals with the realization of Processing In-memory (PIM) computing architecture using Quantum Dot Cellular Automata (QCA) and Akers array. The PIM computing architecture becomes popular due to its effective framework for storage and computation of data in a single unit. Here, we illustrate two input NAND and NOR gate with the help of QCA based Akers Array as case study. T...

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

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