The job shop scheduli ng problem has been studied for decades and known as an NP-hard problem. The fl exible job shop scheduling problem is a generalization of the classical job sche duling problem that allows an oper...The job shop scheduli ng problem has been studied for decades and known as an NP-hard problem. The fl exible job shop scheduling problem is a generalization of the classical job sche duling problem that allows an operation to be processed on one machine out of a set of machines. The problem is to assign each operation to a machine and find a sequence for the operations on the machine in order that the maximal completion time of all operations is minimized. A genetic algorithm is used to solve the f lexible job shop scheduling problem. A novel gene coding method aiming at job sh op problem is introduced which is intuitive and does not need repairing process to validate the gene. Computer simulations are carried out and the results show the effectiveness of the proposed algorithm.展开更多
As mobility and migration become the norm,citizens in modern cities live among people who remain strangers to each other.This creates new opportunities and challenges for urban social life.Public space is a critical f...As mobility and migration become the norm,citizens in modern cities live among people who remain strangers to each other.This creates new opportunities and challenges for urban social life.Public space is a critical forum in which strangers encounter each other and have the opportunity to develop social protocols for coexisting in diversity.New media technologies have huge impact on the form and quality of public space.Digital art can create experimental public spaces in which mediated connections and embodied presence are combined in new ways.Through the practice and research of digital art,we can imagine a communicative city in which urban digital media is less about spectacle,and more about promoting new forms of public speech and social encounter between people.展开更多
文摘The job shop scheduli ng problem has been studied for decades and known as an NP-hard problem. The fl exible job shop scheduling problem is a generalization of the classical job sche duling problem that allows an operation to be processed on one machine out of a set of machines. The problem is to assign each operation to a machine and find a sequence for the operations on the machine in order that the maximal completion time of all operations is minimized. A genetic algorithm is used to solve the f lexible job shop scheduling problem. A novel gene coding method aiming at job sh op problem is introduced which is intuitive and does not need repairing process to validate the gene. Computer simulations are carried out and the results show the effectiveness of the proposed algorithm.
文摘As mobility and migration become the norm,citizens in modern cities live among people who remain strangers to each other.This creates new opportunities and challenges for urban social life.Public space is a critical forum in which strangers encounter each other and have the opportunity to develop social protocols for coexisting in diversity.New media technologies have huge impact on the form and quality of public space.Digital art can create experimental public spaces in which mediated connections and embodied presence are combined in new ways.Through the practice and research of digital art,we can imagine a communicative city in which urban digital media is less about spectacle,and more about promoting new forms of public speech and social encounter between people.
