.png){kind=icon}
Return
A tabu search algorithm for Unspecified Parallel Machine scheduling with shift consideration
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2025.107151.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Two-stage heuristic for high-quality initial solutions in UPMFRS with shifts. • New neighborhood generation for precedence delays and shift constraints. • Enhanced tabu search for improving initial solutions for UPMFRS with(out) shifts. • Tabu search performance evaluation against exact algorithms.
Keywords:
Tabu search
UPMFRS
Industrial scheduling
Resource allocation
Shift optimization
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
Tabu Search Heuristics for Parallel Machine Scheduling with Sequence-Dependent Setup and Ready Times
.png){kind=icon}
PREAI
ShareSaveParallel machine scheduling with dynamic resource allocation via a master–slave genetic algorithm
OAAI
OAAIShareSaveShareSaveShareSaveShareSave
View more