On the public citation graph
An approximate evaluation method for neighbourhood solutions in job shop scheduling problem
0 signed · 35 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.1007/s10845-017-1350-2openalex-snapshot
Review of job shop scheduling research and its new perspectives under Industry 4.0
inferredcites →https://doi.org/10.1007/s12559-015-9370-8openalex-snapshot
Nature Inspired Computing: An Overview and Some Future Directions
inferredcites →https://doi.org/10.1007/s40436-016-0140-yopenalex-snapshot
An adaptive multi-population genetic algorithm for job-shop scheduling problem
inferredcites →https://doi.org/10.1016/0377-2217(93)90182-mopenalex-snapshot
Benchmarks for basic scheduling problems
inferredcites →https://doi.org/10.1016/0377-2217(93)e0294-8openalex-snapshot
Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
inferredcites →https://doi.org/10.1016/j.advengsoft.2013.03.004openalex-snapshot
A new optimization method: Dolphin echolocation
inferredcites →https://doi.org/10.1016/j.cie.2011.12.018openalex-snapshot
A GES/TS algorithm for the job shop scheduling
inferredcites →https://doi.org/10.1016/j.cie.2020.106347openalex-snapshot
Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem
inferredcites →https://doi.org/10.1016/j.cie.2020.106605openalex-snapshot
An efficient two-stage genetic algorithm for a flexible job-shop scheduling problem with sequence dependent attached/detached setup, machine release date and lag-time
inferredcites →https://doi.org/10.1016/j.cor.2005.12.002openalex-snapshot
A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
inferredcites →https://doi.org/10.1016/j.cor.2006.02.024openalex-snapshot
A very fast TS/SA algorithm for the job shop scheduling problem
inferredcites →https://doi.org/10.1016/j.cor.2020.104931openalex-snapshot
Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling
inferredcites →https://doi.org/10.1016/j.cor.2020.104963openalex-snapshot
Optimizing makespan and stability risks in job shop scheduling
inferredcites →https://doi.org/10.1016/j.cor.2022.105731openalex-snapshot
A survey of job shop scheduling problem: The types and models
inferredcites →https://doi.org/10.1016/j.ejor.2020.04.017openalex-snapshot
A meta-heuristic to solve the just-in-time job-shop scheduling problem
inferredcites →https://doi.org/10.1016/j.epsr.2006.06.005openalex-snapshot
An improved TS algorithm for loss-minimum reconfiguration in large-scale distribution systems
inferredcites →https://doi.org/10.1049/iet-cim.2018.0009openalex-snapshot
Review on flexible job shop scheduling
inferredcites →https://doi.org/10.1145/2883817.2883830openalex-snapshot
Semi-autonomous Intersection Collision Avoidance through Job-shop Scheduling
inferredcites →https://doi.org/10.1287/ijoc.6.2.108openalex-snapshot
Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
inferredcites →https://doi.org/10.1287/mnsc.44.2.262openalex-snapshot
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
inferredcites →https://doi.org/10.1287/moor.1.2.117openalex-snapshot
The Complexity of Flowshop and Jobshop Scheduling
inferredcites →https://doi.org/10.1287/opre.17.6.941openalex-snapshot
Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.cie.2024.110324openalex-snapshot
An improved co-evolutionary memetic algorithm based on novel schedule type and unconditional feasibility for hybrid flow-shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.cie.2025.111390openalex-snapshot
A hybrid optimization algorithm based on fitness landscape analysis for generalized job-shop scheduling problems
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106783openalex-snapshot
A path relinking with tabu search algorithm for solving hybrid flow shop scheduling problem considering multiple critical paths
inferred← citeshttps://doi.org/10.1016/j.cor.2026.107610openalex-snapshot
A batch approximate evaluation method for neighborhood solutions in job shop scheduling
inferred← citeshttps://doi.org/10.1016/j.rcim.2024.102782openalex-snapshot
Tabu search based on novel neighborhood structures for solving job shop scheduling problem integrating finite transportation resources
inferred← citeshttps://doi.org/10.1049/cim2.12090openalex-snapshot
The methods of task pre‐allocation and reallocation for multi‐UAV cooperative reconnaissance mission
inferred← citeshttps://doi.org/10.1051/ro/2023067openalex-snapshot
A hybrid genetic algorithm for stochastic job-shop scheduling problems
inferred← citeshttps://doi.org/10.1080/00207543.2025.2508336openalex-snapshot
An efficient and stable intelligent scheduling algorithm based on hybrid neighbourhood structure for flexible job shop scheduling problem benchmarks
inferred← citeshttps://doi.org/10.1109/access.2024.3401080openalex-snapshot
Dynamic Job Shop Scheduling Problem With New Job Arrivals Using Hybrid Genetic Algorithm
inferred← citeshttps://doi.org/10.1109/tits.2024.3511998openalex-snapshot
A Knowledge-Driven Hybrid Algorithm for Solving the Integrated Production and Transportation Scheduling Problem in Job Shop
inferred← citeshttps://doi.org/10.1186/s10033-023-00911-8openalex-snapshot
Necessary and Sufficient Conditions for Feasible Neighbourhood Solutions in the Local Search of the Job-Shop Scheduling Problem
inferred← citeshttps://doi.org/10.26599/tst.2023.9010140openalex-snapshot
Domain Knowledge Used in Meta-Heuristic Algorithms for the Job-Shop Scheduling Problem: Review and Analysis
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.