Information from the abstract
This study proposes an enhanced artificial bee colony algorithm (ENABC) for flexible job shop scheduling with multiple assembly precedence constraints. The objective is to minimize the total penalty cost (TPC), defined as the sum of tardiness, earliness, flow time, and setup costs. ENABC enhances the classical artificial bee colony algorithm through five mechanisms: a three-parameter encoding scheme with efficient decoding heuristics, a dual food-source exploration strategy, a modified precedence-preserving crossover operator, a modified tabu search strategy, and a tabu list to prevent revisiting solutions. The proposed algorithm is evaluated using 10 large-scale industrial problem instances. Compared with benchmark approaches based on the TLSAPVNS and SCEGWO frameworks, ENABC achieved average TPC reductions of 12.96% and 10.90%, respectively. Relative to the factory's existing scheduling practice, the proposed approach reduced the average TPC by 49.93%. Furthermore, it required less computation time than all competitors.
Why this record is monitored
This record has an Impact Signal of 72/100 based on recency, source, collaboration, and bibliographic signals. It prioritizes monitoring and is not a judgment of research quality.
Related topics: Scheduling and Optimization Algorithms · Advanced Manufacturing and Logistics Optimization · Metaheuristic Optimization Algorithms Research
Thai researcher and institutional participation
Naritsak Tuntitippawan · Watcharapan Sukkerd · Watchara Songserm · Chayathach Phuaksaman · Siwaporn Kunnapapdeelert · Teeradej Wuttipornpun · King Mongkut's University of Technology North Bangkok · Rajamangala University of Technology Phra Nakhon · Thammasat University
Data limitations
This page is a bibliographic record based on abstract-level information, not a full analysis or quality assessment. Verify the DOI and original article before citation.