Computer Science
Paper Review Records
All Paper Review Records
14 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
Quantum annealing heuristics for the job shop scheduling problem with availability constraints
AuthorsSamuel Deleplanque; Luis Fernando Pérez Armas; Riad Aggoune
Affiliations1. CNRS, Centrale Lille, JUNIA, Univ. Lille, Univ. Valenciennes, UMR 8520 IEMN, Lille Cedex, France; 2. IESEG School of Management, Univ. Lille, CNRS, UMR 9221 - LEM - Lille Economie Management, Lille, France; 3. Luxembourg Institute of Science and Technology, Esch/Alzette, Luxembourg
Influence maximization: a local branching algorithm for solving the positive influence dominating set problem
AuthorsYamina Bekhti; Mohammed Lalou; Méziane Aïder; Hamamache Kheddouci
Affiliations1. USTHB, Faculte des Mathématiques, Lab LaROMaD, Bab-ezzouar, Algier, Algeria; 2. Université Bourgogne Europe, UFR-Sciences & Techniques, Lab LIB UR 7534, Dijon, France; 3. Université Lyon 1, UFR-Informatique, Lab LIRIS, Villeurbanne, France
A hybrid evolutionary approach for location routing of unmanned aerial vehicles in transmission tower inspection
AuthorsYongliang Lu; Shaowen Lan; Raymond Chiong
Affiliations1. School of Economics and Management, Fuzhou University, Fuzhou, China; 2. School of Science and Technology, The University of New England, Parramatta, Australia; 3. School of Medicine and Public Heath, The University of Newcastle, Callaghan, Australia
A self-learning Variable Neighborhood Search algorithm based on reinforcement learning for Green flexible job-shop scheduling problem
AuthorsMaha Ben Hamida; Ameni Azzouz; Lamjed Ben Said
Affiliations1. SMART LAB, Institut Supérieur de Gestion de Tunis, Université de Tunis, Tunis, Tunisia
Expert Matching · Case Demo
Turn Your Submission Goalsinto a Verifiable Journal Plan
Share your field, deadline, and author profile. CrushSCI uses real review records to suggest a title direction, shortlist journals, and estimate timelines.