On the public citation graph

An intuitive heuristic for solving the buffer allocation problem in unbalanced production line with machine failures

https://doi.org/10.2139/ssrn.6169554
0 signed · 33 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-08219-6_6openalex-snapshot
Non-linear Programming Method for Buffer Allocation in Unreliable Production Lines
inferredcites →https://doi.org/10.1007/s00170-016-9744-4openalex-snapshot
Buffer allocation problem and preventive maintenance planning in non-homogenous unreliable production lines
inferredcites →https://doi.org/10.1007/s00170-021-06971-1openalex-snapshot
Energy-efficient buffer allocation problem in unreliable production lines
inferredcites →https://doi.org/10.1007/s10696-015-9233-3openalex-snapshot
Comparison of three flow line layouts with unreliable machines and profit maximization
inferredcites →https://doi.org/10.1007/s10845-012-0687-9openalex-snapshot
The state of the art on buffer allocation problem: a comprehensive survey
inferredcites →https://doi.org/10.1007/s10845-020-01647-1openalex-snapshot
A comparison of combat genetic and big bang–big crunch algorithms for solving the buffer allocation problem
inferredcites →https://doi.org/10.1016/j.cor.2006.12.008openalex-snapshot
Optimal buffer allocation in finite closed networks with multiple servers
inferredcites →https://doi.org/10.1016/j.cor.2009.06.016openalex-snapshot
Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization
inferredcites →https://doi.org/10.1016/j.cor.2011.08.019openalex-snapshot
An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines
inferredcites →https://doi.org/10.1016/j.cor.2015.01.009openalex-snapshot
Hybrid approach for buffer allocation in open serial production lines
inferredcites →https://doi.org/10.1016/j.ejor.2015.07.005openalex-snapshot
Part sojourn time distribution in a two-machine line
inferredcites →https://doi.org/10.1016/j.ejor.2020.12.050openalex-snapshot
Universal distribution of batch completion times and time-cost tradeoff in a production line with arbitrary buffer size
inferredcites →https://doi.org/10.1016/j.ijpe.2006.02.011openalex-snapshot
A new approach for buffer allocation in unreliable production lines
inferredcites →https://doi.org/10.1016/j.ijpe.2009.06.040openalex-snapshot
An efficient buffer design algorithm for production line profit maximization
inferredcites →https://doi.org/10.1023/a:1016560109076openalex-snapshot
A Genetic Algorithm for the Allocation of Buffer Storage Capacities in a Production Line with Unreliable Machines
inferredcites →https://doi.org/10.1023/a:1018988226612openalex-snapshot
Efficient algorithms for buffer space allocation
inferredcites →https://doi.org/10.1080/00207540701806883openalex-snapshot
Selecting machines and buffers in unreliable series-parallel production lines
inferredcites →https://doi.org/10.1080/00207540701829752openalex-snapshot
Throughput analysis of production systems: recent advances and future topics
inferredcites →https://doi.org/10.1080/00207540801939022openalex-snapshot
A new method for the placement of buffers in serial production lines
inferredcites →https://doi.org/10.1080/00207543.2014.991842openalex-snapshot
A segmentation approach for solving buffer allocation problems in large production systems
inferredcites →https://doi.org/10.1080/00207543.2015.1092612openalex-snapshot
A fast algorithm for buffer allocation problem
inferredcites →https://doi.org/10.1080/00207543.2019.1685709openalex-snapshot
A new method for solving buffer allocation problem in large unbalanced production lines
inferredcites →https://doi.org/10.1080/00207543.2021.1909169openalex-snapshot
Buffer allocation design for unreliable production lines using genetic algorithm and finite perturbation analysis
inferredcites →https://doi.org/10.1080/00207547908919637openalex-snapshot
A gradient technique for general buffer storage design in a production line
inferredcites →https://doi.org/10.1080/0305215x.2010.481022openalex-snapshot
A tabu search approach for buffer allocation in production lines with unreliable machines
inferredcites →https://doi.org/10.1080/07408170304431openalex-snapshot
Optimal buffer allocation in production lines
inferredcites →https://doi.org/10.1080/07408179108963854openalex-snapshot
The Effect of the Coefficient of Variation of Operation Times on the Allocation of Storage Space in Production Line Systems
inferredcites →https://doi.org/10.1080/24725854.2018.1442031openalex-snapshot
The buffer allocation problem in production lines: Formulations, solution methods, and instances
inferredcites →https://doi.org/10.1109/tase.2022.3173641openalex-snapshot
An Interactive Two-Stage Framework for Simultaneous Machine Selection and Buffer Allocation
inferredcites →https://doi.org/10.1109/tit.2003.813506openalex-snapshot
A new metric for probability distributions
inferredcites →https://doi.org/10.1134/s0005117917070098openalex-snapshot
Analysis of a multicriterial buffer capacity optimization problem for a production line
inferredcites →https://doi.org/10.1299/jamdsm.6.1071openalex-snapshot
Optimal Buffer Allocation in Flexible Manufacturing Systems Using Genetic Algorithm and Simulation
inferredcites →https://doi.org/10.3926/jiem.6572openalex-snapshot
Optimization of the OEE indicator through meta-models’ simulation in the buffer allocation problem
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.