On the public citation graph

An Efficient Parallel Iterated Greedy Framework for Co-Scheduling of Distributed Flowshops and Automated Guided Vehicles

0 signed · 26 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/s10957-016-1056-1openalex-snapshot
Complexity of Scheduling Problem in Single-Machine Flexible Manufacturing System with Cyclic Transportation and Unlimited Buffers
inferredcites →https://doi.org/10.1016/j.apm.2011.07.011openalex-snapshot
Realistic two-stage flowshop batch scheduling problems with transportation capacity and times
inferredcites →https://doi.org/10.1016/j.cie.2019.07.041openalex-snapshot
Memetic algorithm for solving flexible flow-shop scheduling problems with dynamic transport waiting times
inferredcites →https://doi.org/10.1016/j.cie.2021.107907openalex-snapshot
An improved iterated greedy algorithm for distributed robotic flowshop scheduling with order constraints
inferredcites →https://doi.org/10.1016/j.cie.2022.108672openalex-snapshot
A parallel hybrid PSO-GA algorithm for the flexible flow-shop scheduling with transportation
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.2005.12.009openalex-snapshot
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
inferredcites →https://doi.org/10.1016/j.engappai.2023.107030openalex-snapshot
A multi-population co-evolutionary algorithm for green integrated process planning and scheduling considering logistics system
inferredcites →https://doi.org/10.1016/j.eswa.2008.09.063openalex-snapshot
An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness
inferredcites →https://doi.org/10.1016/j.eswa.2020.113675openalex-snapshot
An effective discrete artificial bee colony algorithm for multi-AGVs dispatching problem in a matrix manufacturing workshop
inferredcites →https://doi.org/10.1016/j.jmsy.2021.01.009openalex-snapshot
Flow-shop path planning for multi-automated guided vehicles in intelligent textile spinning cyber-physical production systems dynamic environment
inferredcites →https://doi.org/10.1016/j.jmsy.2023.07.004openalex-snapshot
An improved genetic algorithm with modified critical path-based searching for integrated process planning and scheduling problem considering automated guided vehicle transportation task
inferredcites →https://doi.org/10.1016/j.phycom.2020.101236openalex-snapshot
Hybrid genetic-sweep algorithm to solve the vehicle routing problem with drones
inferredcites →https://doi.org/10.1080/00207543.2016.1193246openalex-snapshot
Coordinated scheduling of production and transportation in a two-stage assembly flowshop
inferredcites →https://doi.org/10.1080/00207543.2020.1712488openalex-snapshot
Performance analysis of a flexible flow shop with random and state-dependent batch transport
inferredcites →https://doi.org/10.1080/00207543.2024.2373426openalex-snapshot
Integrated scheduling of multi-objective lot-streaming hybrid flowshop with AGV based on deep reinforcement learning
inferredcites →https://doi.org/10.1080/09511929108944493openalex-snapshot
The role of automated guided vehicles within cellular manufacturing as a shop floor contribution to CIM
inferredcites →https://doi.org/10.1109/tase.2021.3062979openalex-snapshot
A Hybrid Iterated Greedy Algorithm for a Crane Transportation Flexible Job Shop Problem
inferredcites →https://doi.org/10.1109/tase.2021.3129439openalex-snapshot
Learning-Based Grey Wolf Optimizer for Stochastic Flexible Job Shop Scheduling
inferredcites →https://doi.org/10.1109/tase.2024.3356255openalex-snapshot
A Novel Mathematical Model for the Flexible Job-Shop Scheduling Problem With Limited Automated Guided Vehicles
inferredcites →https://doi.org/10.1109/tase.2024.3422473openalex-snapshot
A Knowledge-Driven Cooperative Coevolutionary Algorithm for Integrated Distributed Production and Transportation Scheduling Problem
inferredcites →https://doi.org/10.1109/tfuzz.2021.3053838openalex-snapshot
Fuzzy Integrated Cell Formation and Production Scheduling Considering Automated Guided Vehicles and Human Factors
inferredcites →https://doi.org/10.1109/tii.2022.3211507openalex-snapshot
Dynamic AGV Scheduling Model With Special Cases in Matrix Production Workshop
inferredcites →https://doi.org/10.1109/tsmc.2024.3520381openalex-snapshot
Real-Time Scheduling for Flexible Job Shop With AGVs Using Multiagent Reinforcement Learning and Efficient Action Decoding
inferredcites →https://doi.org/10.26599/tst.2023.9010140openalex-snapshot
Domain Knowledge Used in Meta-Heuristic Algorithms for the Job-Shop Scheduling Problem: Review and Analysis
inferredcites →https://doi.org/10.3390/electronics9050799openalex-snapshot
Flow-Shop Predictive Modeling for Multi-Automated Guided Vehicles Scheduling in Smart Spinning Cyber–Physical Production Systems
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.