On the public citation graph

https://doi.org/10.2139/ssrn.4531225

0 signed · 39 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-319-52250-0openalex-extracted
Design and Analysis of Experiments
inferredcites →https://doi.org/10.1007/s00170-011-3297-3openalex-extracted
Solving the no-wait job-shop problem by using genetic algorithm with automatic adjustment
inferredcites →https://doi.org/10.1007/s00170-013-4866-4openalex-extracted
A memory-based complete local search method with variable neighborhood structures for no-wait job shops
inferredcites →https://doi.org/10.1007/s00186-005-0056-yopenalex-extracted
No-wait Job Shop Scheduling: Tabu Search and Complexity of Subproblems
inferredcites →https://doi.org/10.1007/s00500-015-1852-9openalex-extracted
A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint
inferredcites →https://doi.org/10.1007/s00500-018-3447-8openalex-extracted
A multi-objective migrating birds optimization algorithm for the hybrid flowshop rescheduling problem
inferredcites →https://doi.org/10.1007/s10845-014-0906-7openalex-extracted
Branch-and-bound and PSO algorithms for no-wait job shop scheduling
inferredcites →https://doi.org/10.1007/s10878-012-9466-yopenalex-extracted
Optimal job insertion in the no-wait job shop
inferredcites →https://doi.org/10.1007/s10878-016-0020-1openalex-extracted
The no-wait job shop with regular objective: a method based on optimal job insertion
inferredcites →https://doi.org/10.1007/s12351-018-0414-1openalex-extracted
A new exact algorithm for no-wait job shop problem to minimize makespan
inferredcites →https://doi.org/10.1016/0305-0483(83)90088-9openalex-extracted
A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
inferredcites →https://doi.org/10.1016/0377-2217(89)90225-7openalex-extracted
A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
inferredcites →https://doi.org/10.1016/j.asoc.2016.12.021openalex-extracted
An effective modified migrating birds optimization for hybrid flowshop scheduling problem with lot streaming
inferredcites →https://doi.org/10.1016/j.asoc.2019.05.007openalex-extracted
Total flow time minimization in no-wait job shop using a hybrid discrete group search optimizer
inferredcites →https://doi.org/10.1016/j.asoc.2021.107834openalex-extracted
Migrating birds optimization with a diversified mechanism for blocking flow shops to minimize idle and blocking time
inferredcites →https://doi.org/10.1016/j.cie.2008.09.023openalex-extracted
A fast hybrid tabu search algorithm for the no-wait job shop problem
inferredcites →https://doi.org/10.1016/j.cie.2020.106615openalex-extracted
Solving no-wait job-shop scheduling problems using a multi-start simulated annealing with bi-directional shift timetabling algorithm
inferredcites →https://doi.org/10.1016/j.cie.2022.108238openalex-extracted
Minimizing total completion time in the no-wait jobshop scheduling problem using a backtracking metaheuristic
inferredcites →https://doi.org/10.1016/j.cor.2004.09.009openalex-extracted
An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
inferredcites →https://doi.org/10.1016/j.ejor.2008.09.015openalex-extracted
Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
inferredcites →https://doi.org/10.1016/j.ejor.2017.06.027openalex-extracted
Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
inferredcites →https://doi.org/10.1016/j.engappai.2019.103369openalex-extracted
A population-based iterated greedy algorithm for no-wait job shop scheduling with total flow time criterion
inferredcites →https://doi.org/10.1016/j.eswa.2008.07.005openalex-extracted
A hybrid genetic algorithm for no-wait job shop scheduling problems
inferredcites →https://doi.org/10.1016/j.eswa.2022.116498openalex-extracted
A cooperative coevolutionary algorithm approach to the no-wait job shop scheduling problem
inferredcites →https://doi.org/10.1016/j.eswa.2023.120571openalex-extracted
A knowledge-driven cooperative scatter search algorithm with reinforcement learning for the distributed blocking flow shop scheduling problem
inferredcites →https://doi.org/10.1016/j.ins.2012.06.032openalex-extracted
Migrating Birds Optimization: A new metaheuristic approach and its performance on quadratic assignment problem
inferredcites →https://doi.org/10.1016/j.ins.2014.02.152openalex-extracted
An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation
inferredcites →https://doi.org/10.1016/j.simpat.2019.102065openalex-extracted
A competitive and cooperative Migrating Birds Optimization algorithm for vary-sized batch splitting scheduling problem of flexible Job-Shop with setup time
inferredcites →https://doi.org/10.1016/j.swevo.2017.06.003openalex-extracted
An improved migrating birds optimization for an integrated lot-streaming flow shop scheduling problem
inferredcites →https://doi.org/10.1016/s0167-6377(03)00005-1openalex-extracted
Approximative procedures for no-wait job shop scheduling
inferredcites →https://doi.org/10.1016/s0377-2217(01)00338-1openalex-extracted
Job-shop scheduling with blocking and no-wait constraints
inferredcites →https://doi.org/10.1016/s0377-2217(99)00041-7openalex-extracted
A mathematical programming model for scheduling steelmaking-continuous casting production
inferredcites →https://doi.org/10.1016/s0377-2217(99)00224-6openalex-extracted
Sequencing of jobs in some production system
inferredcites →https://doi.org/10.1057/jors.1994.65openalex-extracted
A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
inferredcites →https://doi.org/10.1080/00207543.2017.1327732openalex-extracted
Improving the migrating birds optimization metaheuristic for the permutation flow shop with sequence-dependent set-up times
inferredcites →https://doi.org/10.1080/002075499190671openalex-extracted
Modelling and optimization of industrial manufacturing processes subject to no-wait constraints
inferredcites →https://doi.org/10.1109/tase.2011.2163305openalex-extracted
An Effective Meta-Heuristic for No-Wait Job Shops to Minimize Makespan
inferredcites →https://doi.org/10.1287/moor.4.4.448openalex-extracted
Complexity of Scheduling Shops with No Wait in Process
inferredcites →https://doi.org/10.1287/opre.44.3.510openalex-extracted
A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
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.