Results 101 to 110 of about 4,751,531 (301)
Applying Machine Based Decomposition in 2-Machine Flow Shops [PDF]
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedure where a series of One Machine Sequencing Problems (OMSPs) are solved ...
Chatterjee Ashis K, Mukherjee, Saral
core
A hybrid chemical reaction optimization scheme for task scheduling on heterogeneous computing systems [PDF]
An application consisting of a group of tasks can be represented by a node- and edge-weighted directed acyclic graph (DAG), in which the vertices represent the computations and the directed edges represent the data dependencies as well as the ...
Xu, Yuming +4 more
core +1 more source
Rotary 3D Printing With Integrated Electroplating
A rotary material extrusion platform integrates localized copper electroplating with printing and encapsulation to fabricate cylindrical polymer–metal structures containing fully embedded, low‐resistance conductive pathways that enable internal Joule heating and thermally activated shape‐memory responses.
Antonio Zagaria +5 more
wiley +1 more source
Energy-efficient distributed heterogeneous re-entrant hybrid flow shop scheduling problem with sequence dependent setup times considering factory eligibility constraints. [PDF]
Geng K, Liu L, Wu Z.
europepmc +1 more source
Better approximation guarantees for job-shop scheduling [PDF]
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogarithmic) approximation guarantee.
Paterson, Michael S. +3 more
core
A Multi‐Scale Machine Learning Framework for the Inverse Design of High Entropy Alloys
High‐entropy alloys offer vast potential for various applications, including electrocatalysis; however, their compositional complexity challenges conventional screening. We introduce an inverse‐design framework combining two neural networks to determine optimal compositions and reconstruct nanoparticle geometry from targeted properties and conventional
Mikael Takoutsin +14 more
wiley +1 more source
Production scheduling that involves distributed factories, machine maintenance, and resource constraints plays a crucial role in manufacturing. However, these realistic constraints have rarely been considered simultaneously in the hybrid flow shop (HFS).
Ying Xu, Shulan Lin, Junqing Li
doaj +1 more source
ABSTRACT Chitosan, a polysaccharide upcycled from biowaste, has long promised sustainable, biocompatible, and antimicrobial films and devices, an appeal reinforced by its recent regulatory recognition, with several chitosan‐based antibacterial dressings gaining clearance through the Food and Drug Administration's 510(k) pathway.
Jacopo Nicoletti +16 more
wiley +1 more source
A BAT ALGORITHM FOR REALISTIC HYBRID FLOWSHOP SCHEDULING PROBLEMS TO MINIMIZE MAKESPAN AND MEAN FLOW TIME [PDF]
This paper addresses the multistage hybrid flow shop (HFS) scheduling problems. The HFS is the special case of flowshop problem. Multiple parallel machines are considered in each stage in the HFS.
M. K. Marichelvam, T. Prabaharan
doaj
A Case Study of Scheduling Storage Tanks Using a Hybrid Genetic Algorithm [PDF]
YesThis paper proposes the application of a hybrid genetic algorithm (GA) for scheduling storage tanks. The proposed approach integrates GAs and heuristic rule-based techniques, decomposing the complex mixed-integer optimization problem into integer and ...
Dahal, Keshav P. +5 more
core +1 more source

