A mathematical for periodic scheduling problems
SIAM Journal on Discrete Mathematics
A tabu search procedure for periodic job shop scheduling
Computers and Industrial Engineering - Special issue: IE in Korea
Petri net modeling and scheduling for cyclic job shops with blocking
Computers and Industrial Engineering
A general model for cyclic machine scheduling problems
Discrete Applied Mathematics
A hybrid electromagnetism-like algorithm for single machine scheduling problem
Expert Systems with Applications: An International Journal
A hybrid genetic algorithm for no-wait job shop scheduling problems
Expert Systems with Applications: An International Journal
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Computers and Industrial Engineering
Computers and Industrial Engineering
High-multiplicity cyclic job shop scheduling
Operations Research Letters
A novel chemistry based metaheuristic optimization method for mining of classification rules
Expert Systems with Applications: An International Journal
Computers and Industrial Engineering
Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
Computers and Operations Research
Hi-index | 12.06 |
In this paper, we present on a periodic job shop scheduling problem (PJSSP) based on the periodic event scheduling problem (PESP), which is different from cyclic scheduling. The PESP schedules a number of recurring events, such that each pair of events fulfills certain constraints during a given time period. To solve such a hard PJSS problem, we propose a hybrid algorithm, namely EM-SA, which is based on electromagnetism-like mechanism (EM) and simulated annealing (SA). To evaluate this proposed EM-SA, some randomly constructed instances are solved, and the related results are compared with SA and optimum solutions obtained by the branch-and-bound (B&B) algorithm. The results demonstrate the efficiency and effectiveness of the proposed hybrid EM-SA algorithm to solve the PJSSP.