On the public citation graph
Criticality-Guided Memetic NSGA-II for University Course Timetabling: A Multi-Objective Flexible Job Shop Scheduling Approach
0 signed · 27 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1099-1425(200001/02)3:1<3::aid-jos32>3.0.co;2-yopenalex-snapshot
Effective neighbourhood functions for the flexible job shop problem
inferredcites →https://doi.org/10.1007/978-1-4419-0910-7openalex-snapshot
Planning and Scheduling in Manufacturing and Services
inferredcites →https://doi.org/10.1007/s00291-007-0097-0openalex-snapshot
A survey of metaheuristic-based techniques for University Timetabling problems
inferredcites →https://doi.org/10.1007/s10479-014-1688-1openalex-snapshot
A review of hyper-heuristics for educational timetabling
inferredcites →https://doi.org/10.1007/s10479-017-2688-8openalex-snapshot
Practices in timetabling in higher education institutions: a systematic review
inferredcites →https://doi.org/10.1007/s10479-023-05325-2openalex-snapshot
A matheuristic for customized multi-level multi-criteria university timetabling
inferredcites →https://doi.org/10.1007/s10489-020-01833-xopenalex-snapshot
A hybrid algorithm for the university course timetabling problem using the improved parallel genetic algorithm and local search
inferredcites →https://doi.org/10.1007/s10696-023-09517-7openalex-snapshot
A memetic NSGA-II for the multi-objective flexible job shop scheduling problem with real-time energy tariffs
inferredcites →https://doi.org/10.1007/s10732-010-9154-yopenalex-snapshot
A hybrid metaheuristic approach to the university course timetabling problem
inferredcites →https://doi.org/10.1007/s10951-006-8495-8openalex-snapshot
An effective hybrid algorithm for university course timetabling
inferredcites →https://doi.org/10.1007/s10951-008-0073-9openalex-snapshot
A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems
inferredcites →https://doi.org/10.1007/s10951-021-00715-5openalex-snapshot
A mixed-integer programming approach for solving university course timetabling problems
inferredcites →https://doi.org/10.1007/s10951-022-00722-0openalex-snapshot
Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation
inferredcites →https://doi.org/10.1007/s10951-022-00747-5openalex-snapshot
Simulated annealing with penalization for university course timetabling
inferredcites →https://doi.org/10.1007/s10951-023-00801-wopenalex-snapshot
Real-world university course timetabling at the International Timetabling Competition 2019
inferredcites →https://doi.org/10.1007/s10951-024-00817-wopenalex-snapshot
Modelling and solving the university course timetabling problem with hybrid teaching considerations
inferredcites →https://doi.org/10.1016/j.cie.2014.11.010openalex-snapshot
A survey of approaches for university course timetabling problem
inferredcites →https://doi.org/10.1016/j.ejor.2011.08.006openalex-snapshot
A honey-bee mating optimization algorithm for educational timetabling problems
inferredcites →https://doi.org/10.1016/j.eswa.2010.06.051openalex-snapshot
A hybrid particle swarm optimization for a university course scheduling problem with flexible preferences
inferredcites →https://doi.org/10.1016/j.procs.2023.10.070openalex-snapshot
Optimising order picking efficiency in a warehouse and distribution centre: A flexible flow shop scheduling approach
inferredcites →https://doi.org/10.1016/s0377-2217(03)00103-6openalex-snapshot
An integer programming formulation for a case study in university timetabling
inferredcites →https://doi.org/10.1057/palgrave.jors.2601830openalex-snapshot
Ant colony optimization for the examination scheduling problem
inferredcites →https://doi.org/10.1109/tase.2013.2274517openalex-snapshot
Multiobjective Flexible Job Shop Scheduling Using Memetic Algorithms
inferredcites →https://doi.org/10.1109/tevc.2007.892759openalex-snapshot
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
inferredcites →https://doi.org/10.1111/mice.12277openalex-snapshot
Scheduling Optimization of Linear Schedule with Constraint Programming
inferredcites →https://doi.org/10.1177/1748302620942467openalex-snapshot
NSGA-II algorithm and application for multi-objective flexible workshop scheduling
inferredcites →https://doi.org/10.3233/ica-160519openalex-snapshot
Genetic algorithms for the scheduling problem with arbitrary precedence relations and skilled operators
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.