On the public citation graph
An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
0 signed · 88 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/3-540-61310-2_29openalex-snapshot
A new approach to computing optimal schedules for the job-shop scheduling problem
inferredcites →https://doi.org/10.1007/3-540-61576-8_79openalex-snapshot
Improving branch and bound for Jobshop scheduling with constraint propagation
inferredcites →https://doi.org/10.1007/978-1-4615-6329-7openalex-snapshot
Decomposition Methods for Complex Factory Scheduling Problems
inferredcites →https://doi.org/10.1016/0166-218x(94)90204-6openalex-snapshot
A branch and bound algorithm for the job-shop scheduling problem
inferredcites →https://doi.org/10.1016/0377-2217(95)00362-2openalex-snapshot
The job shop scheduling problem: Conventional and new solution techniques
inferredcites →https://doi.org/10.1016/b978-0-08-026476-9.50016-2openalex-snapshot
The Job-shop Scheduling Problem
inferredcites →https://doi.org/10.1016/s0167-5060(08)70821-5openalex-snapshot
Computational Complexity of Discrete Optimization Problems
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-0548(99)00137-9openalex-snapshot
An effective hybrid optimization strategy for job-shop scheduling problems
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(98)00113-1openalex-snapshot
Deterministic job-shop scheduling: Past, present and future
inferredcites →https://doi.org/10.1016/s0377-2217(99)00224-6openalex-snapshot
Sequencing of jobs in some production system
inferredcites →https://doi.org/10.1016/s0377-2217(99)00285-4openalex-snapshot
Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
inferredcites →https://doi.org/10.1023/a:1020307925279openalex-snapshot
Complete Local Search with Memory
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/002075499190671openalex-snapshot
Modelling and optimization of industrial manufacturing processes subject to no-wait constraints
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.38.10.1495openalex-snapshot
New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
inferredcites →https://doi.org/10.1287/mnsc.42.6.797openalex-snapshot
A Fast Taboo Search Algorithm for the Job Shop 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.4.4.448openalex-snapshot
Complexity of Scheduling Shops with No Wait in Process
inferredcites →https://doi.org/10.1287/opre.20.3.689openalex-snapshot
Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
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/asmb.2000openalex-snapshot
A simulated annealing approach for reliability‐based chance‐constrained programming
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-319-09339-0_68openalex-snapshot
An Enhanced Estimation of Distribution Algorithm for No-Wait Job Shop Scheduling Problem with Makespan Criterion
inferred← citeshttps://doi.org/10.1007/978-3-642-13520-0_19openalex-snapshot
Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach
inferred← citeshttps://doi.org/10.1007/s00170-011-3197-6openalex-snapshot
Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion
inferred← citeshttps://doi.org/10.1007/s00170-011-3297-3openalex-snapshot
Solving the no-wait job-shop problem by using genetic algorithm with automatic adjustment
inferred← citeshttps://doi.org/10.1007/s00170-012-4169-1openalex-snapshot
Two-machine, no-wait job shop problem with separable setup times and single-server constraints
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1007/s00170-013-5351-9openalex-snapshot
A hybrid particle swarm optimization algorithm for a no-wait flow shop scheduling problem with the total flow time
inferred← citeshttps://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
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1007/s10732-007-9056-9openalex-snapshot
A proposal for a hybrid meta-strategy for combinatorial optimization problems
inferred← citeshttps://doi.org/10.1007/s10845-014-0906-7openalex-snapshot
Branch-and-bound and PSO algorithms for no-wait job shop scheduling
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/s12351-018-0414-1openalex-snapshot
A new exact algorithm for no-wait job shop problem to minimize makespan
inferred← citeshttps://doi.org/10.1016/j.asoc.2010.05.029openalex-snapshot
Simulated annealing algorithm with adaptive neighborhood
inferred← citeshttps://doi.org/10.1016/j.asoc.2014.08.028openalex-snapshot
Scheduling of no buffer job shop cells with blocking constraints and automated guided vehicles
inferred← citeshttps://doi.org/10.1016/j.asoc.2019.05.007openalex-snapshot
Total flow time minimization in no-wait job shop using a hybrid discrete group search optimizer
inferred← citeshttps://doi.org/10.1016/j.cie.2008.09.023openalex-snapshot
A fast hybrid tabu search algorithm for the no-wait job shop problem
inferred← citeshttps://doi.org/10.1016/j.cie.2019.02.041openalex-snapshot
Minimizing makespan in mixed no-wait flowshops with sequence-dependent setup times
inferred← citeshttps://doi.org/10.1016/j.cie.2019.07.054openalex-snapshot
Solving the no-wait job shop scheduling problem with due date constraints: A problem transformation approach
inferred← citeshttps://doi.org/10.1016/j.cie.2020.106615openalex-snapshot
Solving no-wait job-shop scheduling problems using a multi-start simulated annealing with bi-directional shift timetabling algorithm
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.2007.02.017openalex-snapshot
An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops
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.ejor.2005.12.025openalex-snapshot
Feasible insertions in job shop scheduling, short cycles and stable sets
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.05.036openalex-snapshot
A survey of scheduling problems with no-wait in process
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.2011.04.051openalex-snapshot
Production capacity planning and scheduling in a no-wait environment with controllable processing times: An integrated modeling approach
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.ifacol.2017.08.2056openalex-snapshot
An Efficient Algorithm for Scheduling a Flexible Job Shop with Blocking and No-Wait Constraints
inferred← citeshttps://doi.org/10.1016/j.jmatprotec.2007.07.039openalex-snapshot
Evaluating the performance for makespan minimisation in no-wait flowshop sequencing
inferred← citeshttps://doi.org/10.1016/j.omega.2015.12.002openalex-snapshot
Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics
inferred← citeshttps://doi.org/10.1080/00207540902998323openalex-snapshot
Dynamic decentralised balancing of CONWIP production systems
inferred← citeshttps://doi.org/10.1080/00207543.2011.582185openalex-snapshot
A divide and conquer-based greedy search for two-machine no-wait job shop problems with makespan minimisation
inferred← citeshttps://doi.org/10.1080/00207543.2013.784410openalex-snapshot
Studying the effect of different combinations of timetabling with sequencing algorithms to solve the no-wait job shop scheduling problem
inferred← citeshttps://doi.org/10.1080/00207543.2013.808774openalex-snapshot
A real-time scheduling method for the cluster tool with wafer transfer delay
inferred← citeshttps://doi.org/10.1080/00207543.2021.1886368openalex-snapshot
New controllable processing time scheduling with subcontracting strategy for no-wait job shop problem
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/cscwd.2008.4537094openalex-snapshot
Meta-heuristic for no-wait job shops with makespan minimization
inferred← citeshttps://doi.org/10.1109/cscwd.2012.6221910openalex-snapshot
A memory and variable neighborhood structure based complete local search for the no-wait job shop problem
inferred← citeshttps://doi.org/10.1109/icmlc.2009.5212176openalex-snapshot
A bidirectional sequencing algorithm for Job-shop scheduling in ASP
inferred← citeshttps://doi.org/10.1109/ines.2018.8523910openalex-snapshot
On Cyclic Job Shop Scheduling Problem
inferred← citeshttps://doi.org/10.1109/tase.2011.2163305openalex-snapshot
An Effective Meta-Heuristic for No-Wait Job Shops to Minimize Makespan
inferred← citeshttps://doi.org/10.1109/tsmc.2019.2958494openalex-snapshot
Scheduling of Flexible Manufacturing Systems Subject to No-Wait Constraints via Petri Nets and Heuristic Search
inferred← citeshttps://doi.org/10.1142/s0217595912500121openalex-snapshot
A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS
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.1504/ijor.2014.058954openalex-snapshot
A tabu search algorithm for no-wait job shop scheduling problem
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
inferred← citeshttps://doi.org/10.3390/math12213342openalex-snapshot
A Radial Memetic Algorithm to Resolve the No-Wait Job-Shop Scheduling Problem
inferred← citeshttps://doi.org/10.3724/sp.j.1004.2009.00983openalex-snapshot
Study on Complex Product Scheduling Problem with No-wait Constraint between Operations
inferred← citeshttps://doi.org/10.3724/sp.j.1004.2011.00371openalex-snapshot
Integrated Scheduling Algorithm with No-wait Constraint Operation Group
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.26-28.870openalex-snapshot
A Machining Shop Scheduling Model Based on UML and IDEF
inferred← citeshttps://doi.org/10.4230/oasics.atmos.2009.2144openalex-snapshot
Scheduling Aircraft to Reduce Controller Workload
inferred← citeshttps://doi.org/10.4236/jilsa.2011.33018openalex-snapshot
A Cross Entropy-Genetic Algorithm for m-Machines No-Wait Job-ShopScheduling Problem
inferred← citeshttps://doi.org/10.5897/jeeer2014.0504openalex-snapshot
Reduction of side lobe level in non-uniform circular antenna arrays using the simulated annealing 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.