The Simple Assembly Line Balancing Problem with Power Peak Minimization (SALB3PM) minimizes maximum instantaneous power usage while assigning n tasks to m workstations and determining execution schedules within given cycle time constraints. This NP-hard problem couples workstation assignment, temporal sequencing, and p...
Tuyen Van Kieu, Phong Nguyen, Gia-Ho-Ang Bao et al.· Journal of combinatorial opt...· 2 citations
Many exact Hamiltonian-cycle solvers use the same edge-level representation for every input, even when graph structure admits a smaller set of global decisions. We present StructHCP, a SAT--CEGAR pipeline that selects a representation through inexpensive structural recognizers. Specialized searches handle high-degree c...
Peak power limits restrict concurrent tasks and may increase assembly-line cycle time. To the best of our knowledge, this study is the first to minimize cycle time for the simple assembly line balancing problem type 2 (SALBP-2) with a fixed number of workstations and a fixed limit on total instantaneous power. An exact...
Gia-Ho-Ang Bao, Tuyen Van Kieu, Khanh Van To· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.