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 satisfiability (SAT) method finds feasible schedules, searches systematically for shorter cycles, and proves optimality when possible. Two reproducible formulas define looser and tighter power limits for 72 cases based on the standard SALBP library, with Gurobi and CPLEX providing commercial MIP and CP comparisons. Relative to standard SALBP-2 optima, the two limits increase the best-known cycle time by 16.49% and 61.02% on average. The best-performing SAT configurations find a feasible solution for every case, solve more cases to optimality than each commercial solver, and when both prove optimality, are almost always faster under the reported settings.
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
This paper develops the first exact SAT and constraint programming (CP) formulations for the JSPPR, and provides corrected optimal makespans and a complete set of certified optimal results for the JSPPR benchmark, establishing a reliable reference for future studies.
H. Nguyen, Duc Trung Nguyen, Khanh To Van· 0 citations
The shipbuilding industry involves complex assembly processes where multiple subassemblies must be scheduled and integrated into larger blocks under strict precedence constraints. These activities are executed in parallel across constrained workspaces, making efficient scheduling critical to meeting deadlines and avoid...
J. Pernas-Álvarez, Hyungjoo Cha, Jeong Hoon Kim· MATEC Web of Conferences· 0 citations
Efficient resource use in packing and assembly-line applications requires decisions that jointly account for capacity and precedence constraints. The strongly NP-hard bin packing problem with generalized precedence constraints (BPP-GP) models such decisions by minimizing the number of ordered, capacitated bins required...
Sunkanghong Wang, Zheng-Zhong You, Roberto Baldacci et al.· 0 citations
: The hybrid flow shop scheduling problem (HFSP) is a widely used model for energy-efficient multi-stage manufacturing, yet semiconductor studies rarely combine discrete assembly and packaging, batch burn-in processing and speed-adjustable testing within a single four-stage formulation. Most also treat energy consumpti...
Quanh Thi Hoang Vo, P. Phan, H. T. Nguyễn· Computers, Materials & C...· 0 citations
The U-shaped Disassembly Line Balancing Problem (UDLBP) is a challenging combinatorial optimization problem for which efficient solution approaches remain limited. This study proposes an efficient branch-bound-and-remember (BBR) algorithm that integrates a memory-based mechanism and U-shaped dominance rules to effectiv...
Wan-Lin Yang, Da-Yong Han, Zi-Xiang Li et al.· Algorithms· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.