On the public citation graph
Minimizing makespan in a two-machine no-wait flow shop with batch processing machines
0 signed · 45 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/1099-1425(200101/02)4:1<25::aid-jos58>3.0.co;2-7openalex-snapshot
Scheduling batches with simultaneous job processing for two-machine shop problems
inferredcites →https://doi.org/10.1007/s00170-007-1120-yopenalex-snapshot
An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion
inferredcites →https://doi.org/10.1007/s00170-008-1454-0openalex-snapshot
A constructive heuristic for minimizing makespan in no-wait flow shop scheduling
inferredcites →https://doi.org/10.1007/s00170-008-1845-2openalex-snapshot
An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling
inferredcites →https://doi.org/10.1007/s10479-004-5029-7openalex-snapshot
Two-Machine Flowshop Batching and Scheduling
inferredcites →https://doi.org/10.1007/s11047-007-9049-5openalex-snapshot
A review of particle swarm optimization. Part I: background and development
inferredcites →https://doi.org/10.1007/s11047-007-9050-zopenalex-snapshot
A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
inferredcites →https://doi.org/10.1016/j.amc.2006.05.168openalex-snapshot
A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
inferredcites →https://doi.org/10.1016/j.cie.2008.07.021openalex-snapshot
An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem
inferredcites →https://doi.org/10.1016/j.cor.2005.05.028openalex-snapshot
Makespan minimization in a no-wait flow shop problem with two batching machines
inferredcites →https://doi.org/10.1016/j.cor.2006.12.030openalex-snapshot
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
inferredcites →https://doi.org/10.1016/j.ejor.2003.03.002openalex-snapshot
Complexity of flow shop scheduling problems with transportation constraints
inferredcites →https://doi.org/10.1016/j.ejor.2007.08.030openalex-snapshot
A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
inferredcites →https://doi.org/10.1016/j.jmatprotec.2007.07.039openalex-snapshot
Evaluating the performance for makespan minimisation in no-wait flowshop sequencing
inferredcites →https://doi.org/10.1080/00207540701737997openalex-snapshot
Heuristic for no-wait flow shops with makespan minimization
inferredcites →https://doi.org/10.1080/00207540802070942openalex-snapshot
New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
inferredcites →https://doi.org/10.1080/00207543.2010.531775openalex-snapshot
No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates
inferredcites →https://doi.org/10.1109/iccet.2009.215openalex-snapshot
A Genetic Algorithm for Makespan Minimization in a No-wait Flow Shop Problem with Two Batching Machines
inferredcites →https://doi.org/10.1287/ijoc.13.2.120.10521openalex-snapshot
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
inferredcites →https://doi.org/10.1287/opre.12.5.655openalex-snapshot
Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
inferredcites →https://doi.org/10.1287/opre.40.4.750openalex-snapshot
Batching and Scheduling Jobs on Batch and Discrete Processors
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.2139/ssrn.4510970openalex-extracted
A Scatter Search Method for Solving the Fuzzy No-Wait Flow Shop Scheduling with Setup Time
inferred← citeshttps://doi.org/10.1007/s00170-013-5375-1openalex-snapshot
An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines
inferred← citeshttps://doi.org/10.1007/s00170-015-7093-3openalex-snapshot
A novel approach for product makespan prediction in production life cycle
inferred← citeshttps://doi.org/10.1007/s00170-015-7715-9openalex-snapshot
A new meta-heuristics for optimum design of loop layout in flexible manufacturing system with integrated scheduling
inferred← citeshttps://doi.org/10.1007/s10696-024-09548-8openalex-snapshot
On a bi-objective distributed permutation flow shop problem with batch processing machines
inferred← citeshttps://doi.org/10.1016/j.asoc.2018.08.036openalex-snapshot
Minimizing the resource consumption of heterogeneous batch-processing machines using a copula-based estimation of distribution algorithm
inferred← citeshttps://doi.org/10.1016/j.cie.2012.12.023openalex-snapshot
Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.cor.2019.04.016openalex-snapshot
Integrated problem of soaking pit heating and hot rolling scheduling in steel plants
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106859openalex-snapshot
Novel mathematical formulations for parallel-batching processing machine scheduling problems
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.ejor.2021.06.012openalex-snapshot
A survey of scheduling with parallel batch (p-batch) processing
inferred← citeshttps://doi.org/10.1051/ro/2020105openalex-snapshot
Modeling and optimization of batch production based on layout and cutting problems under uncertainty
inferred← citeshttps://doi.org/10.1051/ro/2024008openalex-snapshot
No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis
inferred← citeshttps://doi.org/10.1080/00207543.2016.1140920openalex-snapshot
Minimizing makespan in a no-wait flowshop with two batch processing machines using estimation of distribution algorithm
inferred← citeshttps://doi.org/10.1080/00207543.2019.1661535openalex-snapshot
Quantum-inspired ant colony optimisation algorithm for a two-stage permutation flow shop with batch processing machines
inferred← citeshttps://doi.org/10.1080/00207543.2024.2432473openalex-snapshot
Serial- and hierarchical-batch scheduling: a systematic review and future research directions
inferred← citeshttps://doi.org/10.1080/0305215x.2024.2367600openalex-snapshot
A hybrid scatter search method for solving fuzzy no-wait flow-shop scheduling problems
inferred← citeshttps://doi.org/10.1109/coase.2015.7294259openalex-snapshot
Production planning for a class of batch processing problem
inferred← citeshttps://doi.org/10.1109/docs67533.2025.11200534openalex-snapshot
Integrating Bidirectional LSTM and Proximal Policy Optimization for Flexible Flow Shop Scheduling
inferred← citeshttps://doi.org/10.11606/d.18.2015.tde-28092015-085507openalex-snapshot
Métodos heurísticos para minimização da duração total da programação em ambiente no-wait flow shop com políticas de manutenção-preventiva
inferred← citeshttps://doi.org/10.12677/hjdm.2016.63014openalex-snapshot
Design and Implementation of the Total Completion Time Minimization Model of Test Plan Based on Genetic Algorithm
inferred← citeshttps://doi.org/10.14488/1676-1901.v18i1.2747openalex-snapshot
Um estudo computacional de novas regras de prioridade para flow shop com tempos de setup e diferentes datas de liberação
inferred← citeshttps://doi.org/10.1504/ijise.2014.061991openalex-snapshot
Minimising makespan in a no-wait flow shop with two batch processing machines: a grasp 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.