On the public citation graph
Total flow time minimization in no-wait job shop using a hybrid discrete group search optimizer
0 signed · 78 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/978-3-319-52250-0openalex-snapshot
Design and Analysis of Experiments
inferredcites →https://doi.org/10.1007/s00170-011-3297-3openalex-snapshot
Solving the no-wait job-shop problem by using genetic algorithm with automatic adjustment
inferredcites →https://doi.org/10.1007/s00170-013-4866-4openalex-snapshot
A memory-based complete local search method with variable neighborhood structures for no-wait job shops
inferredcites →https://doi.org/10.1007/s00170-014-6086-yopenalex-snapshot
A two-stage no-wait job shop scheduling problem by using a neuro-evolutionary variable neighborhood search
inferredcites →https://doi.org/10.1007/s00186-005-0056-yopenalex-snapshot
No-wait Job Shop Scheduling: Tabu Search and Complexity of Subproblems
inferredcites →https://doi.org/10.1007/s00500-015-1852-9openalex-snapshot
A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint
inferredcites →https://doi.org/10.1007/s10845-014-0906-7openalex-snapshot
Branch-and-bound and PSO algorithms for no-wait job shop scheduling
inferredcites →https://doi.org/10.1007/s10878-012-9466-yopenalex-snapshot
Optimal job insertion in the no-wait job shop
inferredcites →https://doi.org/10.1007/s10878-016-0020-1openalex-snapshot
The no-wait job shop with regular objective: a method based on optimal job insertion
inferredcites →https://doi.org/10.1016/0305-0483(83)90088-9openalex-snapshot
A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
inferredcites →https://doi.org/10.1016/0377-2217(89)90225-7openalex-snapshot
A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
inferredcites →https://doi.org/10.1016/j.asoc.2011.09.021openalex-snapshot
A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking
inferredcites →https://doi.org/10.1016/j.asoc.2015.02.006openalex-snapshot
An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem
inferredcites →https://doi.org/10.1016/j.cie.2008.03.003openalex-snapshot
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
inferredcites →https://doi.org/10.1016/j.cie.2008.09.023openalex-snapshot
A fast hybrid tabu search algorithm for the no-wait job shop problem
inferredcites →https://doi.org/10.1016/j.cie.2011.02.013openalex-snapshot
A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem
inferredcites →https://doi.org/10.1016/j.cor.2004.09.009openalex-snapshot
An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
inferredcites →https://doi.org/10.1016/j.cor.2011.10.024openalex-snapshot
A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
inferredcites →https://doi.org/10.1016/j.cor.2013.01.005openalex-snapshot
A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
inferredcites →https://doi.org/10.1016/j.ejor.2005.12.009openalex-snapshot
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
inferredcites →https://doi.org/10.1016/j.ejor.2008.09.015openalex-snapshot
Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
inferredcites →https://doi.org/10.1016/j.eswa.2008.07.005openalex-snapshot
A hybrid genetic algorithm for no-wait job shop scheduling problems
inferredcites →https://doi.org/10.1016/j.ins.2010.10.009openalex-snapshot
An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers
inferredcites →https://doi.org/10.1016/j.knosys.2014.11.016openalex-snapshot
A bi-population EDA for solving the no-idle permutation flow-shop scheduling problem with the total tardiness criterion
inferredcites →https://doi.org/10.1016/j.omega.2010.07.007openalex-snapshot
An iterated greedy algorithm for the flowshop scheduling problem with blocking
inferredcites →https://doi.org/10.1016/j.omega.2013.10.002openalex-snapshot
An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem
inferredcites →https://doi.org/10.1016/j.orl.2003.10.003openalex-snapshot
Inapproximability results for no-wait job shop scheduling
inferredcites →https://doi.org/10.1016/s0167-6377(03)00005-1openalex-snapshot
Approximative procedures for no-wait job shop scheduling
inferredcites →https://doi.org/10.1016/s0305-0483(03)00047-1openalex-snapshot
An efficient constructive heuristic for flowtime minimisation in permutation flow shops
inferredcites →https://doi.org/10.1016/s0377-2217(01)00338-1openalex-snapshot
Job-shop scheduling with blocking and no-wait constraints
inferredcites →https://doi.org/10.1016/s0377-2217(99)00041-7openalex-snapshot
A mathematical programming model for scheduling steelmaking-continuous casting production
inferredcites →https://doi.org/10.1016/s0377-2217(99)00224-6openalex-snapshot
Sequencing of jobs in some production system
inferredcites →https://doi.org/10.1038/sj/jors/0450411openalex-snapshot
A No-wait Flowshop Scheduling Heuristic to Minimize Makespan
inferredcites →https://doi.org/10.1057/jors.1994.65openalex-snapshot
A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
inferredcites →https://doi.org/10.1080/00207540210161650openalex-snapshot
Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
inferredcites →https://doi.org/10.1080/002075499190671openalex-snapshot
Modelling and optimization of industrial manufacturing processes subject to no-wait constraints
inferredcites →https://doi.org/10.1080/15458830.1996.11770714openalex-snapshot
Scheduling: Theory, Algorithms, and Systems
inferredcites →https://doi.org/10.1109/tase.2011.2163305openalex-snapshot
An Effective Meta-Heuristic for No-Wait Job Shops to Minimize Makespan
inferredcites →https://doi.org/10.1109/tevc.2009.2011992openalex-snapshot
Group Search Optimizer: An Optimization Algorithm Inspired by Animal Searching Behavior
inferredcites →https://doi.org/10.1155/2014/621393openalex-snapshot
A Discrete Group Search Optimizer for Hybrid Flowshop Scheduling Problem with Random Breakdown
inferredcites →https://doi.org/10.1155/2016/6394253openalex-snapshot
An Improved Semisupervised Outlier Detection Algorithm Based on Adaptive Feature Weighted Clustering
inferredcites →https://doi.org/10.1155/2016/7373617openalex-snapshot
An Enhanced Discrete Artificial Bee Colony Algorithm to Minimize the Total Flow Time in Permutation Flow Shop Scheduling with Limited Buffers
inferredcites →https://doi.org/10.1177/1687814015622900openalex-snapshot
An effective co-evolutionary quantum genetic algorithm for the no-wait flow shop scheduling problem
inferredcites →https://doi.org/10.1177/1687814016664262openalex-snapshot
A discrete group search optimizer for blocking flow shop multi-objective scheduling
inferredcites →https://doi.org/10.1287/ijoc.3.2.149openalex-snapshot
A Computational Study of the Job-Shop Scheduling Problem
inferredcites →https://doi.org/10.1287/mnsc.34.3.391openalex-snapshot
The Shifting Bottleneck Procedure for Job Shop Scheduling
inferredcites →https://doi.org/10.1287/mnsc.38.10.1495openalex-snapshot
New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
inferredcites →https://doi.org/10.1287/moor.1050.0155openalex-snapshot
Minimizing Makespan in No-Wait Job Shops
inferredcites →https://doi.org/10.1287/moor.4.4.448openalex-snapshot
Complexity of Scheduling Shops with No Wait in Process
inferredcites →https://doi.org/10.1287/opre.44.3.510openalex-snapshot
A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.70272openalex-snapshot
A Q‐Learning‐Based Multi‐Phase Grey Wolf Optimization Algorithm for Distributed No‐Wait Job Shop Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-65894-5_3openalex-snapshot
A Study on Sophisticated Production Management for Engineer-to-Order Production: A Mixed Integer Programming Formulation for Production Scheduling
inferred← citeshttps://doi.org/10.1007/s00521-020-05107-yopenalex-snapshot
RETRACTED ARTICLE: Group search optimizer: a nature-inspired meta-heuristic optimization algorithm with its results, variants, and applications
inferred← citeshttps://doi.org/10.1007/s11227-025-07234-6openalex-snapshot
An improved discrete Harris Hawks optimization algorithm for the no-wait job shop problem to minimize total weighted tardiness
inferred← citeshttps://doi.org/10.1007/s11590-022-01966-7openalex-snapshot
A best possible online algorithm for minimizing the total completion time and the total soft penalty cost
inferred← citeshttps://doi.org/10.1016/j.asoc.2021.107834openalex-snapshot
Migrating birds optimization with a diversified mechanism for blocking flow shops to minimize idle and blocking time
inferred← citeshttps://doi.org/10.1016/j.asoc.2021.107960openalex-snapshot
A simulation-based modified backtracking search algorithm for multi-objective stochastic flexible job shop scheduling problem with worker flexibility
inferred← citeshttps://doi.org/10.1016/j.asoc.2025.113094openalex-snapshot
Multi-search mechanism-improved differential evolution algorithm for the no-wait flow shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.cie.2022.107961openalex-snapshot
The distributed flowshop scheduling problem with delivery dates and cumulative payoffs
inferred← citeshttps://doi.org/10.1016/j.cie.2022.108238openalex-snapshot
Minimizing total completion time in the no-wait jobshop scheduling problem using a backtracking metaheuristic
inferred← citeshttps://doi.org/10.1016/j.cie.2025.111402openalex-snapshot
From theory to practice: optimizing makespan in no-wait jobshops with no-passing constraints
inferred← citeshttps://doi.org/10.1016/j.cor.2022.105731openalex-snapshot
A survey of job shop scheduling problem: The types and models
inferred← citeshttps://doi.org/10.1016/j.cor.2026.107437openalex-snapshot
A population-based and Q-learning-cooperative iterated greedy algorithm for distributed no-wait job shop problem
inferred← citeshttps://doi.org/10.1016/j.engappai.2019.103369openalex-snapshot
A population-based iterated greedy algorithm for no-wait job shop scheduling with total flow time criterion
inferred← citeshttps://doi.org/10.1016/j.eswa.2021.116368openalex-snapshot
Chaotic binary Group Search Optimizer for feature selection
inferred← citeshttps://doi.org/10.1016/j.eswa.2022.116498openalex-snapshot
A cooperative coevolutionary algorithm approach to the no-wait job shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.122112openalex-snapshot
A simple migrating birds optimization algorithm with two search modes to solve the no-wait job shop problem
inferred← citeshttps://doi.org/10.1016/j.procs.2022.01.366openalex-snapshot
Flexible job-shop scheduling with release dates, deadlines and sequence dependent setup times: a real-world case
inferred← citeshttps://doi.org/10.1016/j.swevo.2021.100874openalex-snapshot
An Adaptive Iterated Greedy algorithm for distributed mixed no-idle permutation flowshop scheduling problems
inferred← citeshttps://doi.org/10.1016/j.swevo.2026.102283openalex-snapshot
Dual-self-learning knowledge-based local search approach for lot-streaming flexible job shop scheduling with asynchronous assembly
inferred← citeshttps://doi.org/10.1080/0305215x.2024.2431849openalex-snapshot
An effective metaheuristic with adaptive delay active decoding for the no-wait job-shop scheduling problem
inferred← citeshttps://doi.org/10.1109/access.2020.3015737openalex-snapshot
Improved Beam Search for Optimizing No-Wait Flowshops With Release Times
inferred← citeshttps://doi.org/10.1111/itor.13108openalex-snapshot
Shop scheduling in manufacturing environments: a review
inferred← citeshttps://doi.org/10.1177/17483026251322104openalex-snapshot
A hybrid discrete artificial bee colony optimization algorithm for the no-wait job shop problem with tardiness criterion
inferred← citeshttps://doi.org/10.24425/mper.2023.147196openalex-snapshot
Optimizing the Job Shop Scheduling Problem with a no Wait Constraint by Using the Jaya Algorithm Approach
inferred← citeshttps://doi.org/10.3390/a14050145openalex-snapshot
No-Wait Job Shop Scheduling Using a Population-Based Iterated Greedy Algorithm
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.