.png){kind=icon}
.png){kind=icon}
Return
EFFICIENT SCHEDULING FOR MACHINING PROCESSES CONSIDERING MACHINE UNAVAILABILITY CONSTRAINTS
.png){kind=icon}
PRE
AI
DOI：10.23055/ijietap.2026.33.2.11391.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents an integrated scheduling framework for single-machine machining processes to deal with the challenges posed by machine availability constraints due to preventive maintenance, cooling intervals, and unexpected breakdowns. Our primary objective was to minimize the makespan while accounting for job-specific processing and release times. The NP-hard nature of the problem rendered our initial mixed-integer programming model computationally prohibitive for large instances. Thus, we tailored a branch-and-bound algorithm to derive optimal solutions for small to medium-sized problems by leveraging specific upper and lower bounds. We then employed a genetic algorithm using a permutation-based chromosome and problem-specific decoder to generate near-optimal solutions for large-scale instances. This hybrid approach balances solution quality with computational efficiency, rendering it highly suitable for a wide range of practical industrial manufacturing applications.
Keywords:
Machining Process
Machine Scheduling
Unavailability Constraints
Branch-And-Bound Algorithm
Genetic Algorithm
Journal
I
IF:
1
Papers:
47
Citations:
561