Search results:
Found 7
Listing 1  7 of 7 
Sort by

Choose an application
This edited book presents new results in the area of the development of exact and heuristic scheduling algorithms. It contains eight articles accepted for publication for a Special Issue in the journal Algorithms. The book presents new algorithms, e.g., for flow shop, job shop, and parallel machine scheduling problems. The particular articles address subjects such as a heuristic for the routing and scheduling problem with time windows, applied to the automotive industry in Mexico, a heuristic for the blocking job shop problem with tardiness minimization based on new neighborhood structures, fast heuristics for the Euclidean traveling salesman problem or a new mathematical model for the periodaggregated resource leveling problem with variable job duration, and several others.
heuristic  time windows  feasible loading  autocarrier transportation problem (ACTP)  job shop scheduling  blocking  total tardiness  permutations  repairing scheme  simulated annealing  uniform parallel machines  unavailability constraints  makespan  quadratic programming  optimal algorithm  job shop  flow shop  sprecedence constraints  exact algorithms  complexity  scheduling  shop floor performance  flowshop  manufacturing  scheduling  uncertain duration  flowshop  jobshop  makespan criterion  heuristic algorithm  traveling salesman problem  computational experiment  time complexity  resource leveling problem  project scheduling  scheduling  job shop problem  flow shop problem, uniform parallel machine problems  precedence constraints  uncertainty  shop floor performance  manufacturing  traveling salesman problem  heuristics  resource leveling  project scheduling
Choose an application
The development of a closedloop cycle is a necessary condition so as to develop a circular economy model as an alternative to the linear model, in order to maintain the value of products and materials for as long as possible. For this motive, the definition of the value must be demonstrated for both the environment and the economy. The presence of these analyses should be associated with the social dimension and the human component. A strong cooperation between social and technical profiles is a new challenge for all researchers. End of life of products attract a lot of attention, and the final output could be the production of technologies suitable for managing this waste.
CO2 emissions  economic analysis  photovoltaic  subsidies  circular economy  environmental assessment  quantitative analysis  waste management  renewable energy  economic growth  sustainable development  Health and Social Care  branches  NUTS3 regions  employment  professions  Czech Republic  European Union  prediction  cluster analysis  cluster analysis  unsupervised classification  mixed data  circular economy  waste management  tourism industry  Italy  circular economy  multilevel perspective  SWOT  ecodesign  sustainability  circular economy (CE)  circular business models (CBMs)  Industry 4.0  industrial symbiosis  industrial district (ID)  Italian ceramic industry  sustainability  circular economy  education  digital transformation of education  open online education  open educational resources  massive open online courses  MOOCs  complexity  multiple value  phygitalization  circular commerce  retailing  digitalization  territory  technology  commercial cycle  circular economy  social sciences  sustainability
Choose an application
This open access book constitutes the proceedings of the 23rd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2020, which took place in Dublin, Ireland, in April 2020, and was held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. The 31 regular papers presented in this volume were carefully reviewed and selected from 98 submissions. The papers cover topics such as categorical models and logics; language theory, automata, and games; modal, spatial, and temporal logics; type theory and proof theory; concurrency theory and process calculi; rewriting theory; semantics of programming languages; program analysis, correctness, transformation, and verification; logics of programming; software specification and refinement; models of concurrent, reactive, stochastic, distributed, hybrid, and mobile systems; emerging models of computation; logical aspects of computational complexity; models of software security; and logical foundations of data bases.
Mathematical Logic and Foundations  Discrete Mathematics in Computer Science  Programming Languages, Compilers, Interpreters  Programming Techniques  Logic in AI  Computer Systems Organization and Communication Networks  categorical models and logics  language theory, automata, and games  modal, spatial, and temporal logics  type theory and proof theory  concurrency theory and process calculi  rewriting theory  semantics of programming languages  program analysis, correctness, transformation, and verification  logics of programming  software specification and refinement  emerging models of computation  logical aspects of computational complexity  models of software security  logical foundations of data bases  mathematics  artificial intellegence  formal logic  linguistics  Mathematical foundations  Mathematical logic  Discrete mathematics  Maths for computer scientists  Programming & scripting languages: general  Compilers & interpreters  Computer programming / software engineering  Artificial intelligence  Computer networking & communications
Choose an application
Quantum information has dramatically changed information science and technology, looking at the quantum nature of the information carrier as a resource for building new information protocols, designing radically new communication and computation algorithms, and ultrasensitive measurements in metrology, with a wealth of applications. From a fundamental perspective, this new discipline has led us to regard quantum theory itself as a special theory of information, and has opened routes for exploring solutions to the tension with general relativity, based, for example, on the holographic principle, on noncausal variations of the theory, or else on the powerful algorithm of the quantum cellular automaton, which has revealed new routes for exploring quantum fields theory, both as a new microscopic mechanism on the fundamental side, and as a tool for efficient physical quantum simulations for practical purposes. In this golden age of foundations, an astonishing number of new ideas, frameworks, and results, spawned by the quantum information theory experience, have revolutionized the way we think about the subject, with a new research community emerging worldwide, including scientists from computer science and mathematics.
reconstruction of quantum theory  entanglement  monogamy  quantum nonlocality  conserved informational charges  limited information  complementarity  characterization of unitary group and state spaces  algebraic quantum theory  C*algebra  gelfand duality  classical context  bohrification  process theory  classical limit  purity  higherorder interference  generalised probabilistic theories  Euclidean Jordan algebras  Pauli exclusion principle  quantum foundations  Xray spectroscopy  underground experiment  silicon drift detector  measurement uncertainty relations  relative entropy  position  momentum  quantum mechanics  the measurement problem  collapse models  Xrays  quantum gravity  discrete spacetime  causal sets  path summation  entropic gravity  physical computing models  complexity classes  causality  blind source separation (BSS)  qubit pair  exchange coupling  entangled pure state  unentanglement criterion  probabilities in quantum measurements  independence of random quantum sources  iterant  Clifford algebra  matrix algebra  braid group  Fermion  Dirac equation  quantum information  quantum computation  semiclassical physics  quantum control  quantum genetic algorithm  samplingbased learning control (SLC)  quantum foundations  relativity  quantum gravity  cluster states  multipartite entanglement  percolation  Shannon information  quantum information  quantum measurements  consistent histories  incompatible frameworks  single framework rule  probability theory  entropy  quantum relative entropy  quantum information  quantum mechanics  inference  quantum measurement  quantum estimation  macroscopic quantum measurement  quantum annealing  adiabatic quantum computing  hard problems  Hadamard matrix  binary optimization  reconstruction of quantum mechanics  conjugate systems  Jordan algebras  quantum correlations  Gaussian states  Gaussian unitary operations  continuousvariable systems  Wignerfriend experiment  nogo theorem  quantum foundations  interpretations of quantum mechanics  subsystem  agent  conservation of information  purification  group representations  commuting subalgebras  quantum walks  Hubbard model  Thirring model  quantum information  quantum foundations  quantum theory and gravity
Choose an application
Global crop production must substantially increase to meet the needs of a rapidly growing population. This is constrained by the availability of nutrients, water, and land. There is also an urgent need to reduce the negative environmental impacts of crop production. Collectively, these issues represent one of the greatest challenges of the twentyfirst century. Sustainable cropping systems based on ecological principles are the core of integrated approaches to solve this critical challenge. This special issue provides an international basis for revealing the underlying mechanisms of sustainable cropping systems to drive agronomic innovations. It includes review and original research articles that report novel scientific findings on improvement in cropping systems related to crop yields and their resistance to biotic and abiotic stressors, resource use efficiency, environmental impact, sustainability, and ecosystem services.
organic cropping system  maize  soybean  wheat  partial returns  Zea mais L.  Triticum aestivum L.  Helianthus annuus L.  organic fertilization  mineral N fertilization  protein crops  systematic review  Europe  multiple correspondence analysis (MCA)  potato (Solanum tuberosum)  shade  light  yield  growth  quality  cover crops  agrobiodiversity  conventionalization  system approach  harvesting strategies  forage yield and quality  forage sorghum  pearl millet  Texas High Plains  kura clover  living mulch  cover crop  perennial  conservation  nitrogen  forage  economics  farmer’s perception  maize  pushpull technology  stemborer  notillage  conservation agriculture  durum wheat  gluten fractions  SDSPAGE analysis  leguminous cover crop  vetch  double cropping  grain yield  N uptake  N use efficiency  rice  hierarchical patch dynamics  cropping system design  upscaling  vineyard system  complexity  organization  cropping systems  water  nitrogen  WHCNS  scenario analyses  maize production  nitrogen use efficiency  nitrogen nutrition  Acidic soil  crop rotation  enzyme activities  green manure  sustainable yield index  nutrient balance  crop residue incorporation  straw decomposition  residue C and N release  SOC and STN stocks  cover crop  manure  nitrate  nitrogen  cereal rye  maize  notillage  cover crop  irrigation  weed suppression  gross margin  faba bean  forage pea  fall grazing  cover crop  catch crop  nutrient cycling  cropping systems  sustainable crop production  agroecology  nutrient use efficiency  water use efficiency  environmental quality
Choose an application
Graph theory is an important area of applied mathematics with a broad spectrum of applications in many fields. This book results from aSpecialIssue in the journal Mathematics entitled “GraphTheoretic Problems and Their New Applications”. It contains 20 articles covering a broad spectrum of graphtheoretic works that were selected from 151 submitted papers after a thorough refereeing process. Among others, it includes a deep survey on mixed graphs and their use for solutions ti scheduling problems. Other subjects include topological indices, domination numbers of graphs, domination games, contraction mappings, and neutrosophic graphs. Several applications of graph theory are discussed, e.g., the use of graph theory in the context of molecular processes.
graph coloring  Kempe chain  Kempelocking  Birkhoff diamond  hypergraph  generalized hypertree  bound  component  adjacent matrix  signless Laplacian  spectral radius  connectivity  intervalvalued fuzzy graph  intuitionistic fuzzy graph  intervalvalued intuitionistic fuzzy graph  singlevalued neutrosophic graph  intervalvalued neutrosophic graph  complement  krainbow dominating function  krainbow domination number  grids  domination number  Cartesian product  directed cycle  DD index  Wiener index  Edge Wiener  degree of a vertex  distance between two vertices  normalized Laplacian  resistance distance  degreeKirchhoff index  spanning tree  extremal values  PI index  ktrees  distance  Zagreb indices  reformulated Zagreb indices  degree of vertex  degree of edge  embedding  edge congestion  wirelength  enhanced hypercube  subtree  generating function  fan graph  wheel graph  “partitions” of wheel graph  neutrosophic graph  complete neutrosophic graph  bipartite neutrosophic graph  complement neutrosophic graph  road transport network  wireless multihop network and social network  perfect matching  kextendable  induced matching extendable  bipartite matching extendable graph  evolution theory  evolution algebra  mitotic cell cycle  totalcolored graph  inverse degree index  generalized first Zagreb index  sum lordeg index  corona product  join of graphs  line graph  Mycielskian graph  polynomials in graphs  bmetric space  bmetriclike space  general contractive mappings  graphic contraction mappings  approximation methods  chromatic number  combinatorial optimization  complexity analysis  evolutionary approach  genetic algorithm  graph coloring  NPhard  stochastic convergence  domination game  competitionindependence game  mixed graph  vertex coloring  chromatic number  edge coloring  chromatic index  chromatic polynomial  unittime scheduling  makespan criterion  n/a
Choose an application
Some of the most beautiful studies in Mathematics are related to Symmetry and Geometry. For this reason, we select here some contributions about such aspects and Discrete Geometry. As we know, Symmetry in a system means invariance of its elements under conditions of transformations. When we consider network structures, symmetry means invariance of adjacency of nodes under the permutations of node set. The graph isomorphism is an equivalence relation on the set of graphs. Therefore, it partitions the class of all graphs into equivalence classes. The underlying idea of isomorphism is that some objects have the same structure if we omit the individual character of their components. A set of graphs isomorphic to each other is denominated as an isomorphism class of graphs. The automorphism of a graph will be an isomorphism from G onto itself. The family of all automorphisms of a graph G is a permutation group.
strongly regular graph  automorphism group  orbit matrix  binary polyhedral group  icosahedron  dodecahedron  600cell  Electric multiple unit trains  highlevel maintenance planning  time window  0–1 programming model  particle swarm algorithm  fixed point  splitquaternion  quadratic polynomial  splitoctonion  neutrosophic set  neutrosophic rough set  pessimistic (optimistic) multigranulation neutrosophic approximation operators  complete lattice  rough set  matroid  operator  attribute reduction  graded rough sets  rough intuitionistic fuzzy sets  dominance relation  logical conjunction operation  logical disjunction operation  multigranulation  planar point set  convex polygon  disjoint holes  fuzzy logic  pseudoBCI algebra  quasimaximal element  KGunion  quasialternating BCKalgebra  quality function deployment  engineering characteristics  group decision making  2tuple  metro station  emergency routes  graph partitioning  graph clustering  invariant measures  partition comparison  finite automorphism groups  graph automorphisms  Fuzzy sets  ring  normed space  fuzzy normed ring  fuzzy normed ideal  fuzzy implication  quantum Balgebra  qfilter  quotient algebra  basic implication algebra  Detour–Harary index  maximum  unicyclic  bicyclic  cacti  threeway decisions  intuitionistic fuzzy sets  multigranulation rough intuitionistic fuzzy sets  granularity importance degree  complexity  Chebyshev polynomials  gear graph  pyramid graphs  edge detection  Laplacian operation  regularization  parameter selection  performance evaluation  aggregation operator  triangular norm  ?convex set  atombond connectivity index  geometric arithmetic index  line graph  generalized bridge molecular graph  graceful labeling  edge graceful labeling  edge even graceful labeling  polar grid graph  graph  good drawing  crossing number  join product  cyclic permutation  nonlinear  synchronized  linear discrete  chaotic system  algorithm  generalized permanental polynomial  coefficient  copermanental  isoperimetric number  random graph  intersection graph  social network  Abel–Grassmann’s groupoid (AGgroupoid)  Abel–Grassmann’s group (AGgroup)  involution AGgroup  commutative group  filter  graceful labeling  edge even graceful labeling  cylinder grid graph  selective maintenance  multistate system  human reliability  optimization  genetic algorithm  hypernearring  multitransformation  embedding  distance matrix (spectrum)  distance signlees Laplacian matrix (spectrum)  (generalized) distance matrix  spectral radius  transmission regular graph  graph  good drawing  crossing number  join product  cyclic permutation  cyclic associative groupoid (CAgroupoid)  cancellative  variant CAgroupoids  decomposition theorem  construction methods
Listing 1  7 of 7 
Sort by
