Results 281 to 290 of about 51,211 (328)
Emergence of Light‐Transforming Layered Hybrid Halide Perovskites
Advanced Functional Materials, EarlyView.The emerging class of light‐transforming layered halide perovskite materials is reviewed, outlining challenges for their development and perspectives toward application in the future. Abstract Layered hybrid halide perovskites (LHPs) have attracted considerable attention in optoelectronics.
Ghewa AlSabeh, Jovana V. Milić
wiley +1 more source
Understanding Decoherence of the Boron Vacancy Center in Hexagonal Boron Nitride
Advanced Functional Materials, EarlyView.State‐of‐the‐art computations unravel the intricate decoherence dynamics of the boron vacancy center in hexagonal boron nitride across magnetic fields from 0 to 3 T. Five distinct regimes emerge, dominated by nuclear spin interactions, revealing optimal coherence times of 1–20 µs in the 180–350 mT range for isotopically pure samples.
András Tárkányi, Viktor Ivády
wiley +1 more source
Energy-efficient scheduling of AGV-assisted robotic flexible flowshops under learning and processing time uncertainty. [PDF]
Sci RepDehnavi S, Mokhtari H, Rezvan MT.
europepmc +1 more source
Optimizing energy, downtime, and throughput in footwear production through machine learning. [PDF]
Sci RepSudhakar PK, Muthucumaraswamy R.
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
International Journal of Production Research, 1981
Abstract The paper defines batch or job shop production and reviews the functions of production planning and production control in a job shop manufacturing situation. It argues that the separation of planning and control has resulted in the artificial isolation of the sequencing problem in job shop research.
J. BROWNE, J. E. BOONJ, B. J. DAVIES
openaire +1 more source
Abstract The paper defines batch or job shop production and reviews the functions of production planning and production control in a job shop manufacturing situation. It argues that the separation of planning and control has resulted in the artificial isolation of the sequencing problem in job shop research.
J. BROWNE, J. E. BOONJ, B. J. DAVIES
openaire +1 more source
1996
Within the great variety of production scheduling problems the general job shop problem (JSP) is the probably most studied one by academic research during the last decade. It has earned a reputation for being notoriously difficult to solve. It illustrates at least some of the demands required by a wide array of real world problems.
SIMON Y. FOO, YOSHIYASU TAKEFUJI
openaire +2 more sources
Within the great variety of production scheduling problems the general job shop problem (JSP) is the probably most studied one by academic research during the last decade. It has earned a reputation for being notoriously difficult to solve. It illustrates at least some of the demands required by a wide array of real world problems.
SIMON Y. FOO, YOSHIYASU TAKEFUJI
openaire +2 more sources
Scheduling the General Job-Shop
Management Science, 1985A family of algorithms is described for finding optimum schedules for job-shops. The algorithms are of a branch and bound type but have a complete schedule associated with each node of the search tree. Branching from nodes is based on important conflicts in the schedule. Some results are provided.
Jeffrey R. Barker, Graham B. McMahon
openaire +1 more source