Results 241 to 250 of about 24,116 (312)
APPLYING SYSTEMATIC LOCAL SEARCH TO JOB SHOP SCHEDULING PROBLEMS
, 2006 Lei Duan
openalex +1 more source
Advanced Functional Materials, EarlyView.A unidirectional cerebral organoid–organoid neural circuit is established using a microfluidic platform, enabling controlled directional propagation of electrical signals, neuroinflammatory cues, and neurodegenerative disease–related proteins between spatially separated organoids.
Kyeong Seob Hwang +9 more
wiley +1 more source
Advanced Functional Materials, EarlyView.Guided by the golden ratio, a class of aperiodic architected metamaterials is introduced to address the intrinsic trade‐off between strength and toughness. By unifying local geometric heterogeneity with global order, the golden‐ratio‐guided aperiodic architecture promotes spatial delocalization of damage tolerence regions, leading to more tortuous ...
Junjie Deng +9 more
wiley +1 more source
Advanced Functional Materials, EarlyView.Molecular engineering of a nonconjugated radical polymer enables a significant enhancement of the glass transition temperature. The amorphous nature and tunability of the polymer, arising from its nonconjugated backbone, facilitates the fabrication of organic memristive devices with an exceptionally high yield (>95%), as well as substantial ...
Daeun Kim +14 more
wiley +1 more source
Development of a shop floor scheduling and allocation framework for operations management excellence using cutting-edge technologies. [PDF]
Sci RepTripathi V +2 more
europepmc +1 more source
Heurísticas para resolver el problema de programación job-shop flexible con división de lotes
Torabi de Solà, Mireia
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
1997
The job shop scheduling problem (JSP) is a resource allocation problem where the resources are called machines. The problem involves finding an assignment (schedule) for a set of jobs to the machines so that the jobs can be completed “optimally.” Each job may consist of several tasks, and each task must be processed on a particular machine. Furthermore,
Nirwan Ansari, Edwin Hou
openaire +2 more sources
The job shop scheduling problem (JSP) is a resource allocation problem where the resources are called machines. The problem involves finding an assignment (schedule) for a set of jobs to the machines so that the jobs can be completed “optimally.” Each job may consist of several tasks, and each task must be processed on a particular machine. Furthermore,
Nirwan Ansari, Edwin Hou
openaire +2 more sources