On the public citation graph
Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks
0 signed · 211 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/1520-6750(199510)42:7<1129::aid-nav3220420711>3.0.co;2-mopenalex-snapshot
Note: A local-search heuristic for large set-covering problems
inferredcites →https://doi.org/10.1007/978-1-59745-530-5_12openalex-snapshot
Design and Analysis of Experiments
inferredcites →https://doi.org/10.1007/s10845-015-1084-yopenalex-snapshot
Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms
inferredcites →https://doi.org/10.1007/s10951-005-1640-yopenalex-snapshot
A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks
inferredcites →https://doi.org/10.1007/s11740-017-0716-9openalex-snapshot
General variable neighborhood search algorithm to minimize makespan of the distributed no-wait flow shop scheduling problem
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/j.asoc.2010.03.008openalex-snapshot
Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach
inferredcites →https://doi.org/10.1016/j.asoc.2010.12.006openalex-snapshot
An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems
inferredcites →https://doi.org/10.1016/j.asoc.2015.11.034openalex-snapshot
Multi-objective adaptive large neighborhood search for distributed reentrant permutation flow shop scheduling
inferredcites →https://doi.org/10.1016/j.cie.2013.08.004openalex-snapshot
Improved bounds for hybrid flow shop scheduling with multiprocessor tasks
inferredcites →https://doi.org/10.1016/j.compeleceng.2005.09.004openalex-snapshot
Performance of local search heuristics on scheduling a class of pipelined multiprocessor tasks
inferredcites →https://doi.org/10.1016/j.cor.2009.06.019openalex-snapshot
The distributed permutation flowshop scheduling problem
inferredcites →https://doi.org/10.1016/j.cor.2009.11.001openalex-snapshot
Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
inferredcites →https://doi.org/10.1016/j.cor.2010.09.020openalex-snapshot
Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
inferredcites →https://doi.org/10.1016/j.cor.2012.12.014openalex-snapshot
Multiprocessor task scheduling in multistage hybrid flowshops: A hybrid artificial bee colony algorithm with bi-directional planning
inferredcites →https://doi.org/10.1016/j.ejor.2009.09.024openalex-snapshot
The hybrid flow shop scheduling problem
inferredcites →https://doi.org/10.1016/j.ejor.2014.01.035openalex-snapshot
Minimizing shifts for personnel task scheduling problems: A three-phase algorithm
inferredcites →https://doi.org/10.1016/j.ejor.2014.05.024openalex-snapshot
A scatter search algorithm for the distributed permutation flowshop scheduling problem
inferredcites →https://doi.org/10.1016/j.eswa.2005.04.009openalex-snapshot
An adaptive genetic algorithm with dominated genes for distributed scheduling problems
inferredcites →https://doi.org/10.1016/j.eswa.2008.08.033openalex-snapshot
Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic
inferredcites →https://doi.org/10.1016/j.eswa.2011.01.173openalex-snapshot
Metaheuristic methods in hybrid flow shop scheduling problem
inferredcites →https://doi.org/10.1016/j.eswa.2014.06.023openalex-snapshot
Modeling and heuristics for scheduling of distributed job shops
inferredcites →https://doi.org/10.1016/j.eswa.2015.03.012openalex-snapshot
A hybrid genetic algorithm for the hybrid flow shop scheduling problem with nighttime work and simultaneous work constraints: A case study from the transformer industry
inferredcites →https://doi.org/10.1016/j.eswa.2015.08.025openalex-snapshot
A shuffled frog-leaping algorithm for hybrid flow shop scheduling with two agents
inferredcites →https://doi.org/10.1016/j.eswa.2017.01.006openalex-snapshot
Efficient heuristics for the parallel blocking flow shop scheduling problem
inferredcites →https://doi.org/10.1016/j.ijpe.2012.05.015openalex-snapshot
Particle swarm optimization with cocktail decoding method for hybrid flow shop scheduling problems with multiprocessor tasks
inferredcites →https://doi.org/10.1016/j.ijpe.2016.10.001openalex-snapshot
Note on the Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks
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/s0377-2217(02)00644-6openalex-snapshot
Hybrid flow-shop scheduling problems with multiprocessor task systems
inferredcites →https://doi.org/10.1057/jors.1988.63openalex-snapshot
Two-Stage, Hybrid Flowshop Scheduling Problem
inferredcites →https://doi.org/10.1057/palgrave.jors.2601716openalex-snapshot
Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
inferredcites →https://doi.org/10.1057/palgrave.jors.2602625openalex-snapshot
An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks
inferredcites →https://doi.org/10.1080/00207540500536939openalex-snapshot
Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach
inferredcites →https://doi.org/10.1080/00207540701294627openalex-snapshot
A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
inferredcites →https://doi.org/10.1080/00207540701871085openalex-snapshot
Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic
inferredcites →https://doi.org/10.1080/00207543.2011.644819openalex-snapshot
An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem
inferredcites →https://doi.org/10.1080/00207543.2012.737948openalex-snapshot
A hybrid Tabu sample-sort simulated annealing approach for solving distributed scheduling problem
inferredcites →https://doi.org/10.1080/00207543.2013.790571openalex-snapshot
Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm
inferredcites →https://doi.org/10.1080/00207543.2014.910627openalex-snapshot
Bi-objective reentrant hybrid flowshop scheduling: an iterated Pareto greedy algorithm
inferredcites →https://doi.org/10.1080/00207543.2014.948578openalex-snapshot
A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
inferredcites →https://doi.org/10.1080/0305215x.2013.827673openalex-snapshot
An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem
inferredcites →https://doi.org/10.1080/15458830.1996.11770714openalex-snapshot
Scheduling: Theory, Algorithms, and Systems
inferredcites →https://doi.org/10.1080/18756891.2011.9727808openalex-snapshot
A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem
inferredcites →https://doi.org/10.1109/access.2017.2696118openalex-snapshot
New efficient lower bound for the Hybrid Flow Shop Scheduling Problem with Multiprocessor Tasks
inferredcites →https://doi.org/10.1109/cec.2016.7744065openalex-snapshot
A hybrid discrete cuckoo search for distributed permutation flowshop scheduling problem
inferredcites →https://doi.org/10.1109/icmsao.2015.7152245openalex-snapshot
A harmony search algorithm for hybrid flow shop scheduling with multiprocessor task problems
inferredcites →https://doi.org/10.1109/ssci.2016.7850041openalex-snapshot
Scheduling of stochastic distributed assembly flowshop under complex constraints
inferredcites →https://doi.org/10.1504/ejie.2012.045605openalex-snapshot
Minimising makespan for multistage hybrid flowshop scheduling problems with multiprocessor tasks by a hybrid immune algorithm
inferredcites →https://doi.org/10.1504/ejie.2013.058392openalex-snapshot
A competitive variable neighbourhood search algorithm for the blocking flow shop problem
inferredcites →https://doi.org/10.1504/ijaip.2016.080191openalex-snapshot
Multistage multiprocessor task scheduling in hybrid flow shop problems using discrete firefly algorithm
inferredcites →https://doi.org/10.4028/www.scientific.net/amm.284-287.3712openalex-snapshot
Multiprocessor Flow Shop Scheduling Problem with Common due Window
inferredcites →https://doi.org/10.5281/zenodo.1108922openalex-snapshot
A General Variable Neighborhood Search Algorithm To Minimize Makespan Of The Distributed Permutation Flowshop Scheduling Problem
inferredcites →https://doi.org/10.5897/sre10.1014openalex-snapshot
An NEH-based heuristic algorithm for distributed permutation flowshop scheduling problems
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.4689403openalex-extracted
Ant Colony Algorithm and Grey Relation Theory for Resources Optimal Allocation
inferred← citeshttps://doi.org/10.1002/dac.5022openalex-snapshot
A new reliability‐based task scheduling algorithm in cloud computing
inferred← citeshttps://doi.org/10.1007/978-3-031-34821-1_86openalex-snapshot
Building Optimal Consortia in Smart Production Ecosystems
inferred← citeshttps://doi.org/10.1007/978-3-031-98304-7_46openalex-snapshot
Fuzzy-Based Analysis of Hybrid Flow Shop with Multiprocessor Scheduling: A Bibliometric Perspective
inferred← citeshttps://doi.org/10.1007/978-3-032-27242-3_3openalex-snapshot
Enhancing Scalability in Distributed Flexible Flowshop Scheduling: A Hybrid RL-CP Approach
inferred← citeshttps://doi.org/10.1007/978-981-16-1354-8_8openalex-snapshot
Heterogeneous Distributed Flow Shop Scheduling and Reentrant Hybrid Flow Shop Scheduling in Seamless Steel Tube Manufacturing
inferred← citeshttps://doi.org/10.1007/978-981-95-6035-6_6openalex-snapshot
Vague Multi-objective Optimization by Branch and Bound Method
inferred← citeshttps://doi.org/10.1007/978-981-96-5257-0_8openalex-snapshot
Optimization Methods in Staff Scheduling and Allocation
inferred← citeshttps://doi.org/10.1007/s00521-022-07714-3openalex-snapshot
A multi-neighborhood-based multi-objective memetic algorithm for the energy-efficient distributed flexible flow shop scheduling problem
inferred← citeshttps://doi.org/10.1007/s10462-021-10081-5openalex-snapshot
Recent trends in distributed production network scheduling problem
inferred← citeshttps://doi.org/10.1007/s10479-022-04537-2openalex-snapshot
Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups
inferred← citeshttps://doi.org/10.1007/s10489-020-01809-xopenalex-snapshot
Effective Constructive Heuristic and Metaheuristic for the Distributed Assembly Blocking Flow-shop Scheduling Problem
inferred← citeshttps://doi.org/10.1007/s10696-026-09659-4openalex-snapshot
Decoupling-based evolutionary algorithm for distributed heterogeneous hybrid flow shop scheduling problem
inferred← citeshttps://doi.org/10.1007/s11081-024-09911-6openalex-snapshot
Energy-efficient optimization for distributed blocking hybrid flowshop scheduling: a self-regulating iterative greedy algorithm under makespan constraint
inferred← citeshttps://doi.org/10.1007/s12065-026-01263-7openalex-snapshot
Effective metaheuristics for the distributed hybrid flow shop problem with identical parallel machines and setup times
inferred← citeshttps://doi.org/10.1007/s12190-024-02364-1openalex-snapshot
A Q-learning grey wolf optimizer for a distributed hybrid flowshop rescheduling problem with urgent job insertion
inferred← citeshttps://doi.org/10.1007/s12293-021-00329-6openalex-snapshot
Integrated production and distribution scheduling in distributed hybrid flow shops
inferred← citeshttps://doi.org/10.1007/s12293-022-00364-xopenalex-snapshot
A multiobjective memetic algorithm for integrated process planning and scheduling problem in distributed heterogeneous manufacturing systems
inferred← citeshttps://doi.org/10.1007/s12293-025-00468-0openalex-snapshot
Dual evolutionary algorithm based on Dyna-Q for distributed heterogeneous hybrid flow shop problems with L-R trapezoidal fuzzy numbers
inferred← citeshttps://doi.org/10.1007/s12652-022-04392-wopenalex-snapshot
Reinforcement learning iterated greedy algorithm for distributed assembly permutation flowshop scheduling problems
inferred← citeshttps://doi.org/10.1007/s40092-018-0278-2openalex-snapshot
Role of batch size in scheduling optimization of flexible manufacturing system using genetic algorithm
inferred← citeshttps://doi.org/10.1007/s40747-021-00400-2openalex-snapshot
A cooperated shuffled frog-leaping algorithm for distributed energy-efficient hybrid flow shop scheduling with fuzzy processing time
inferred← citeshttps://doi.org/10.1007/s40747-023-01288-wopenalex-snapshot
Automatic algorithm design of distributed hybrid flowshop scheduling with consistent sublots
inferred← citeshttps://doi.org/10.1007/s40747-024-01484-2openalex-snapshot
A dimension-aware gaining-sharing knowledge algorithm for distributed hybrid flowshop scheduling with resource-dependent processing time
inferred← citeshttps://doi.org/10.1007/s40815-021-01050-9openalex-snapshot
Solving Type-2 Fuzzy Distributed Hybrid Flowshop Scheduling Using an Improved Brain Storm Optimization Algorithm
inferred← citeshttps://doi.org/10.1007/s42452-020-03895-5openalex-snapshot
A new memetic global and local search algorithm for solving hybrid flow shop with multiprocessor task scheduling problem
inferred← citeshttps://doi.org/10.1007/s42979-022-01398-1openalex-snapshot
An Analytical Study of Multiprocessor Scheduling Using Metaheuristic Approach
inferred← citeshttps://doi.org/10.1007/s42979-023-02517-2openalex-snapshot
Multiprocessor Task Scheduling Optimization for Cyber-Physical System Using an Improved Salp Swarm Optimization Algorithm
inferred← citeshttps://doi.org/10.1016/j.asoc.2020.106946openalex-snapshot
A discrete artificial bee colony algorithm for the distributed heterogeneous no-wait flowshop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2023.110563openalex-snapshot
An artificial immune differential evolution algorithm for scheduling a distributed heterogeneous flexible flowshop
inferred← citeshttps://doi.org/10.1016/j.asoc.2024.111508openalex-snapshot
Modeling and multi-objective optimization for energy-aware scheduling of distributed hybrid flow-shop
inferred← citeshttps://doi.org/10.1016/j.asoc.2024.112230openalex-snapshot
An adaptive shuffled frog-leaping algorithm for flexible flow shop scheduling problem with batch processing machines
inferred← citeshttps://doi.org/10.1016/j.asoc.2024.112650openalex-snapshot
A novel multi-objective hybrid evolutionary algorithm based on variable weight strategy for distributed hybrid flowshop scheduling with batch processing machines and variable sublots
inferred← citeshttps://doi.org/10.1016/j.asoc.2026.115269openalex-snapshot
Meta-heuristic algorithms for optimization of hybrid flowshop scheduling problems: A comprehensive review of the state of the art
inferred← citeshttps://doi.org/10.1016/j.cie.2020.106288openalex-snapshot
Design of a testbed for hybrid flow shop scheduling with identical machines
inferred← citeshttps://doi.org/10.1016/j.cie.2020.106638openalex-snapshot
An improved artificial bee colony algorithm for distributed heterogeneous hybrid flowshop scheduling problem with sequence-dependent setup times
inferred← citeshttps://doi.org/10.1016/j.cie.2020.106998openalex-snapshot
Energy-efficiency scheduling of multi-cell manufacturing system considering total handling distance and eligibility constraints
inferred← citeshttps://doi.org/10.1016/j.cie.2021.107337openalex-snapshot
Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times
inferred← citeshttps://doi.org/10.1016/j.cie.2022.108200openalex-snapshot
An efficient self-adaptive artificial bee colony algorithm for the distributed resource-constrained hybrid flowshop problem
inferred← citeshttps://doi.org/10.1016/j.cie.2024.110624openalex-snapshot
A bi-population cooperative scatter search algorithm for distributed hybrid flow shop scheduling with machine breakdown
inferred← citeshttps://doi.org/10.1016/j.cor.2019.05.002openalex-snapshot
Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105482openalex-snapshot
Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106919openalex-snapshot
A Q-learning driven multi-objective evolutionary algorithm for worker fatigue dual-resource-constrained distributed hybrid flow shop
inferred← citeshttps://doi.org/10.1016/j.cor.2026.107601openalex-snapshot
A decision-supported bi-objective genetic algorithm for hybrid flow shop scheduling with learning effects
inferred← citeshttps://doi.org/10.1016/j.eij.2024.100566openalex-snapshot
Distributed hybrid flowshop scheduling with consistent sublots under delivery time windows: A penalty lot-assisted iterated greedy algorithm
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.08.009openalex-snapshot
A systematic review of multi-objective hybrid flow shop scheduling
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.02.001openalex-snapshot
A review and classification on distributed permutation flowshop scheduling problems
inferred← citeshttps://doi.org/10.1016/j.engappai.2020.103540openalex-snapshot
Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks
inferred← citeshttps://doi.org/10.1016/j.engappai.2024.108491openalex-snapshot
A hybrid estimation of distribution algorithm for solving assembly flexible job shop scheduling in a distributed environment
inferred← citeshttps://doi.org/10.1016/j.engappai.2024.109915openalex-snapshot
A knowledge-driven scatter search algorithm for the distributed hybrid flow shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.engappai.2025.110537openalex-snapshot
Q-learning based estimation of distribution algorithm for scheduling distributed heterogeneous flexible flow-shop with mixed buffering limitation
inferred← citeshttps://doi.org/10.1016/j.engappai.2025.112292openalex-snapshot
A Deep Q-Network-driven multi-objective evolutionary algorithm for distributed heterogeneous hybrid flow shop scheduling with worker fatigue
inferred← citeshttps://doi.org/10.1016/j.eswa.2018.07.055openalex-snapshot
New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics
inferred← citeshttps://doi.org/10.1016/j.eswa.2019.113147openalex-snapshot
Hybrid enhanced discrete fruit fly optimization algorithm for scheduling blocking flow-shop in distributed environment
inferred← citeshttps://doi.org/10.1016/j.eswa.2020.113716openalex-snapshot
Local search metaheuristic for solving hybrid flow shop problem in slabs and beams manufacturing
inferred← citeshttps://doi.org/10.1016/j.eswa.2020.113721openalex-snapshot
An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers
inferred← citeshttps://doi.org/10.1016/j.eswa.2020.114282openalex-snapshot
Multi-objective evolutionary algorithms with heuristic decoding for hybrid flow shop scheduling problem with worker constraint
inferred← citeshttps://doi.org/10.1016/j.eswa.2021.115339openalex-snapshot
Multi-objective distributed reentrant permutation flow shop scheduling with sequence-dependent setup time
inferred← citeshttps://doi.org/10.1016/j.eswa.2021.115422openalex-snapshot
New benchmark algorithm for hybrid flowshop scheduling with identical machines
inferred← citeshttps://doi.org/10.1016/j.eswa.2021.115453openalex-snapshot
Multi-objective evolutionary algorithm based on multiple neighborhoods local search for multi-objective distributed hybrid flow shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.eswa.2022.116921openalex-snapshot
A discrete learning fruit fly algorithm based on knowledge for the distributed no-wait flow shop scheduling with due windows
inferred← citeshttps://doi.org/10.1016/j.eswa.2022.117555openalex-snapshot
A Pareto-based hybrid iterated greedy algorithm for energy-efficient scheduling of distributed hybrid flowshop
inferred← citeshttps://doi.org/10.1016/j.eswa.2022.119151openalex-snapshot
Modelling and optimization of distributed heterogeneous hybrid flow shop lot-streaming scheduling problem
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.119805openalex-snapshot
An improved multi-population genetic algorithm with a greedy job insertion inter-factory neighborhood structure for distributed heterogeneous hybrid flow shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.121570openalex-snapshot
A multiobjective memetic algorithm with particle swarm optimization and Q-learning-based local search for energy-efficient distributed heterogeneous hybrid flow-shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.121667openalex-snapshot
A tri-individual iterated greedy algorithm for the distributed hybrid flow shop with blocking
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.121947openalex-snapshot
Distributed Permutation Flow Shop Scheduling Problem with Worker flexibility: Review, trends and model proposition
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.122914openalex-snapshot
CMRS: A digital twin enabled workers recruitment and task scheduling scheme for future crowdsourcing networks under precedence constraints
inferred← citeshttps://doi.org/10.1016/j.eswa.2024.125344openalex-snapshot
Two-stage learning scatter search algorithm for the distributed hybrid flow shop scheduling problem with machine breakdown
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.126523openalex-snapshot
Scheduling of stochastic distributed hybrid flow-shop by hybrid estimation of distribution algorithm and proximal policy optimization
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.126603openalex-snapshot
Ship pipe production optimization method for solving distributed heterogeneous energy-efficient flexible flowshop scheduling with mobile resource limitation
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.126713openalex-snapshot
Scheduling distributed heterogeneous non-permutation flowshop to minimize the total weighted tardiness
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.131022openalex-snapshot
Hyper-heuristic with asynchronous double learning for dynamic distributed hybrid flow shop scheduling problem with fatigue factor
inferred← citeshttps://doi.org/10.1016/j.jii.2023.100514openalex-snapshot
Hybrid flow-shop scheduling in collaborative manufacturing with a multi-crossover-operator genetic algorithm
inferred← citeshttps://doi.org/10.1016/j.jii.2024.100574openalex-snapshot
The multi-factory two-stage assembly scheduling problem
inferred← citeshttps://doi.org/10.1016/j.jmsy.2021.09.012openalex-snapshot
Mathematical model and discrete artificial Bee Colony algorithm for distributed integrated process planning and scheduling
inferred← citeshttps://doi.org/10.1016/j.jmsy.2023.09.017openalex-snapshot
A hybrid genetic algorithm for distributed hybrid blocking flowshop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.jmsy.2024.07.011openalex-snapshot
Reinforcement learning for distributed hybrid flowshop scheduling problem with variable task splitting towards mass personalized manufacturing
inferred← citeshttps://doi.org/10.1016/j.knosys.2019.104894openalex-snapshot
A distributed permutation flowshop scheduling problem with the customer order constraint
inferred← citeshttps://doi.org/10.1016/j.knosys.2020.105527openalex-snapshot
Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.knosys.2020.105536openalex-snapshot
A cooperative coevolution algorithm for multi-objective fuzzy distributed hybrid flow shop
inferred← citeshttps://doi.org/10.1016/j.knosys.2023.110252openalex-snapshot
A multi-class teaching–learning-based optimization for multi-objective distributed hybrid flow shop scheduling
inferred← citeshttps://doi.org/10.1016/j.knosys.2023.110309openalex-snapshot
Toward automated algorithm configuration for distributed hybrid flow shop scheduling with multiprocessor tasks
inferred← citeshttps://doi.org/10.1016/j.micpro.2022.104685openalex-snapshot
A novel algorithm for priority-based task scheduling on a multiprocessor heterogeneous system
inferred← citeshttps://doi.org/10.1016/j.promfg.2020.01.354openalex-snapshot
An Artificial Bee Colony Algorithm for the Distributed Hybrid Flowshop Scheduling Problem
inferred← citeshttps://doi.org/10.1016/j.rcim.2021.102277openalex-snapshot
A Pareto-based collaborative multi-objective optimization algorithm for energy-efficient scheduling of distributed permutation flow-shop with limited buffers
inferred← citeshttps://doi.org/10.1016/j.swevo.2022.101058openalex-snapshot
Novel MILP and CP models for distributed hybrid flowshop scheduling problem with sequence-dependent setup times
inferred← citeshttps://doi.org/10.1016/j.swevo.2022.101190openalex-snapshot
A network memetic algorithm for energy and labor-aware distributed heterogeneous hybrid flow shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.swevo.2023.101409openalex-snapshot
A collaboration-based multi-objective algorithm for distributed hybrid flowshop scheduling with resource constraints
inferred← citeshttps://doi.org/10.1016/j.swevo.2024.101771openalex-snapshot
A knowledge-driven many-objective algorithm for energy-efficient distributed heterogeneous hybrid flowshop scheduling with lot-streaming
inferred← citeshttps://doi.org/10.1016/j.swevo.2025.101936openalex-snapshot
Selection hyperheuristic with knowledge-based Q-learning for dynamic distributed hybrid flow shop scheduling problem considering operation inspection
inferred← citeshttps://doi.org/10.1016/j.swevo.2025.101991openalex-snapshot
Multi-agent reinforcement learning-aided evolutionary algorithm for a many-objective distributed hybrid flow shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.swevo.2026.102327openalex-snapshot
Dynamic distributed production scheduling problem with simultaneous job arrivals and machine breakdowns: Learning to learn iterated greedy algorithm
inferred← citeshttps://doi.org/10.1016/j.swevo.2026.102403openalex-snapshot
Adaptive fruit fly optimization-assisted logic-based benders decomposition for distributed parallel precast flowshop scheduling
inferred← citeshttps://doi.org/10.1038/s41598-022-19215-3openalex-snapshot
Collaborative variable neighborhood search for multi-objective distributed scheduling in two-stage hybrid flow shop with sequence-dependent setup times
inferred← citeshttps://doi.org/10.1080/00207543.2020.1753897openalex-snapshot
A discrete artificial bee colony algorithm for distributed hybrid flowshop scheduling problem with sequence-dependent setup times
inferred← citeshttps://doi.org/10.1080/00207543.2020.1780333openalex-snapshot
A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop
inferred← citeshttps://doi.org/10.1080/00207543.2020.1797207openalex-snapshot
Production planning and scheduling in multi-factory production networks: a systematic literature review
inferred← citeshttps://doi.org/10.1080/00207543.2020.1837982openalex-snapshot
Effective heuristics and metaheuristics to minimise total tardiness for the distributed permutation flowshop scheduling problem
inferred← citeshttps://doi.org/10.1080/00207543.2020.1842938openalex-snapshot
Supply chain-oriented permutation flowshop scheduling considering flexible assembly and setup times
inferred← citeshttps://doi.org/10.1080/00207543.2021.1880656openalex-snapshot
Hybrid two stage flowshop scheduling with secondary resources based on time buckets
inferred← citeshttps://doi.org/10.1080/00207543.2022.2031331openalex-snapshot
A novel shuffled frog-leaping algorithm with reinforcement learning for distributed assembly hybrid flow shop scheduling
inferred← citeshttps://doi.org/10.1080/00207543.2023.2262616openalex-snapshot
Multi-population genetic algorithm with greedy job insertion inter-factory neighbourhoods for multi-objective distributed hybrid flow-shop scheduling with unrelated-parallel machines considering tardiness
inferred← citeshttps://doi.org/10.1080/00207543.2024.2383781openalex-snapshot
Minimising makespan in distributed assembly hybrid flowshop scheduling problems
inferred← citeshttps://doi.org/10.1080/00207543.2024.2427344openalex-snapshot
Multi-line hybrid flow-shop scheduling problem with energy considerations
inferred← citeshttps://doi.org/10.1080/00207543.2025.2553820openalex-snapshot
Enhanced logic-based Benders decomposition methods for the distributed heterogeneous non-permutation flow shop scheduling problem
inferred← citeshttps://doi.org/10.1080/0305215x.2019.1674295openalex-snapshot
Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping
inferred← citeshttps://doi.org/10.1080/0305215x.2024.2328188openalex-snapshot
A parallel deep adaptive large neighbourhood search algorithm for distributed heterogeneous hybrid flow shops with mixed-model assembly scheduling
inferred← citeshttps://doi.org/10.1080/0305215x.2024.2410844openalex-snapshot
A Q-learning multi-objective grey wolf optimizer for the distributed hybrid flowshop scheduling problem
inferred← citeshttps://doi.org/10.1080/0305215x.2024.2425724openalex-snapshot
A multi-objective differential evolution algorithm for the distributed hybrid flowshop scheduling problem with deteriorating jobs
inferred← citeshttps://doi.org/10.1080/0951192x.2025.2455651openalex-snapshot
Ant colony algorithm and grey relation theory for manufacturing resources optimal allocation towards industry 5.0
inferred← citeshttps://doi.org/10.1080/0951192x.2025.2478005openalex-snapshot
Cooperation-based bi-level rescheduling method for multi-objective distributed hybrid flow shop with unrelated parallel machines under multi-type disturbances
inferred← citeshttps://doi.org/10.1109/access.2018.2873401openalex-snapshot
A Hybrid Pareto-Based Tabu Search for the Distributed Flexible Job Shop Scheduling Problem With E/T Criteria
inferred← citeshttps://doi.org/10.1109/access.2019.2917273openalex-snapshot
Solving Distributed Hybrid Flowshop Scheduling Problems by a Hybrid Brain Storm Optimization Algorithm
inferred← citeshttps://doi.org/10.1109/access.2020.2973575openalex-snapshot
Multiprocessor Scheduling Based on Evolutionary Technique for Solving Permutation Flow Shop Problem
inferred← citeshttps://doi.org/10.1109/access.2020.3041369openalex-snapshot
Fuzzy Distributed Hybrid Flow Shop Scheduling Problem With Heterogeneous Factory and Unrelated Parallel Machine: A Shuffled Frog Leaping Algorithm With Collaboration of Multiple Search Strategies
inferred← citeshttps://doi.org/10.1109/cec.2019.8790051openalex-snapshot
A Probability Model-based Memetic Algorithm for Distributed Heterogeneous Flow-Shop Scheduling
inferred← citeshttps://doi.org/10.1109/coase.2019.8842885openalex-snapshot
An Iterated Greedy Algorithm for Distributed Hybrid Flowshop Scheduling Problem with Total Tardiness Minimization
inferred← citeshttps://doi.org/10.1109/ntci60157.2023.10403702openalex-snapshot
A Two-Tiered Destructive Iterated Greedy Approach for Enhancing Efficiency in Multi-Factory Hybrid Flow Shop Scheduling with Blocking Constraint
inferred← citeshttps://doi.org/10.1109/tase.2021.3062994openalex-snapshot
Iterated Greedy Algorithms for Flow-Shop Scheduling Problems: A Tutorial
inferred← citeshttps://doi.org/10.1109/tase.2021.3119353openalex-snapshot
An Ant Colony Optimization Behavior-Based MOEA/D for Distributed Heterogeneous Hybrid Flow Shop Scheduling Problem Under Nonidentical Time-of-Use Electricity Tariffs
inferred← citeshttps://doi.org/10.1109/tase.2026.3716037openalex-snapshot
Scheduling Aircraft Cabin Door Assembly Line via Q-Learning Strategy-Assisted Particle Swarm Optimizer
inferred← citeshttps://doi.org/10.1109/tetci.2020.3022372openalex-snapshot
A Bi-Population Cooperative Memetic Algorithm for Distributed Hybrid Flow-Shop Scheduling
inferred← citeshttps://doi.org/10.1109/tetci.2022.3174915openalex-snapshot
LS-HH: A Learning-Based Selection Hyper-Heuristic for Distributed Heterogeneous Hybrid Blocking Flow-Shop Scheduling
inferred← citeshttps://doi.org/10.1109/tetci.2023.3271331openalex-snapshot
Energy-Efficient Iterative Greedy Algorithm for the Distributed Hybrid Flow Shop Scheduling With Blocking Constraints
inferred← citeshttps://doi.org/10.1109/tevc.2021.3106168openalex-snapshot
A Cooperative Memetic Algorithm With Learning-Based Agent for Energy-Aware Distributed Hybrid Flow-Shop Scheduling
inferred← citeshttps://doi.org/10.1109/tii.2020.3043734openalex-snapshot
Energy-Efficient Scheduling of Distributed Flow Shop With Heterogeneous Factories: A Real-World Case From Automobile Industry in China
inferred← citeshttps://doi.org/10.1109/tsmc.2025.3648136openalex-snapshot
Learning-Assisted Genetic Programming Hyperheuristic for Dynamic Distributed Hybrid Flow Shop Scheduling With Uncertain Events
inferred← citeshttps://doi.org/10.1109/yac59482.2023.10401624openalex-snapshot
Multi-objective Evolutionary Algorithm for Distributed Hybrid Flow Shop Scheduling with Multiprocessor Tasks
inferred← citeshttps://doi.org/10.1142/s2196888824500222openalex-snapshot
Sustainable Distributed Scheduling Problem
inferred← citeshttps://doi.org/10.1145/3377929.3389986openalex-snapshot
An improved brain storm optimization algorithm for fuzzy distributed hybrid flowshop scheduling with setup time
inferred← citeshttps://doi.org/10.1177/00202940241245241openalex-snapshot
An improved memetic algorithm for distributed hybrid flow shop scheduling problem with operation inspection and reprocessing
inferred← citeshttps://doi.org/10.23919/ascc56756.2022.9828208openalex-snapshot
Discrete Artificial Bee Colony Algorithm for the Distributed Resource Constrained Hybrid Flowshop Problem
inferred← citeshttps://doi.org/10.23919/ccc58697.2023.10240312openalex-snapshot
Solving Distribute Flexible Flow Shop Scheduling Problem with an Imitation Learning Framework
inferred← citeshttps://doi.org/10.23919/csms.2022.0002openalex-snapshot
Q-Learning-Based Teaching-Learning Optimization for Distributed Two-Stage Hybrid Flow Shop Scheduling with Fuzzy Processing Time
inferred← citeshttps://doi.org/10.23919/csms.2023.0016openalex-snapshot
Intelligent Optimization Under Multiple Factories: Hybrid Flow Shop Scheduling Problem with Blocking Constraints Using an Advanced Iterated Greedy Algorithm
inferred← citeshttps://doi.org/10.23919/csms.2024.0003openalex-snapshot
Two-Stage Adaptive Memetic Algorithm with Surprisingly Popular Mechanism for Energy-Aware Distributed Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup Time
inferred← citeshttps://doi.org/10.2478/jaiscr-2024-0006openalex-snapshot
A Shuffled Frog Leaping Algorithm with Q-Learning for Distributed Hybrid Flow Shop Scheduling Problem with Energy-Saving
inferred← citeshttps://doi.org/10.26599/tst.2021.9010007openalex-snapshot
Decomposition-based multi-objective optimization for energy-aware distributed hybrid flow shop scheduling with multiprocessor tasks
inferred← citeshttps://doi.org/10.26599/tst.2021.9010009openalex-snapshot
Distributed scheduling problems in intelligent manufacturing systems
inferred← citeshttps://doi.org/10.3233/jifs-191175openalex-snapshot
Fuzzy distributed two-stage hybrid flow shop scheduling problem with setup time: collaborative variable search
inferred← citeshttps://doi.org/10.32604/cmc.2024.055244openalex-snapshot
Q-Learning-Assisted Meta-Heuristics for Scheduling Distributed Hybrid Flow Shop Problems
inferred← citeshttps://doi.org/10.3389/fieng.2024.1337174openalex-snapshot
Enhancing multi-objective evolutionary algorithms with machine learning for scheduling problems: recent advances and survey
inferred← citeshttps://doi.org/10.3390/machines13121115openalex-snapshot
Block–Neighborhood-Based Multi-Objective Evolutionary Algorithm for Distributed Resource-Constrained Hybrid Flow Shop with Machine Breakdown
inferred← citeshttps://doi.org/10.3390/math13152401openalex-snapshot
Graph Knowledge-Enhanced Iterated Greedy Algorithm for Hybrid Flowshop Scheduling Problem
inferred← citeshttps://doi.org/10.3390/pr11061846openalex-snapshot
Scheduling Jobs with a Limited Waiting Time Constraint on a Hybrid Flowshop
inferred← citeshttps://doi.org/10.3390/pr13010095openalex-snapshot
A Deep Reinforcement Advantage Actor-Critic-Based Co-Evolution Algorithm for Energy-Aware Distributed Heterogeneous Flexible Job Shop Scheduling
inferred← citeshttps://doi.org/10.3390/pr13030728openalex-snapshot
A Deep Reinforcement Learning-Based Evolutionary Algorithm for Distributed Heterogeneous Green Hybrid Flowshop Scheduling
inferred← citeshttps://doi.org/10.3390/sym15040786openalex-snapshot
A Shuffled Frog-Leaping Algorithm with Cooperations for Distributed Assembly Hybrid-Flow Shop Scheduling with Factory Eligibility
inferred← citeshttps://doi.org/10.3390/sym15040836openalex-snapshot
A Dual-Population Genetic Algorithm with Q-Learning for Multi-Objective Distributed Hybrid Flow Shop Scheduling Problem
inferred← citeshttps://doi.org/10.3390/sym18020350openalex-snapshot
A Shuffled Frog Leaping Algorithm with Q-Learning for Distributed Hybrid Flow Shop Scheduling Problem with Missing Operations
inferred← citeshttps://doi.org/10.36055/jiss.v7i1.13027openalex-snapshot
Model optimasi penjadwalan pallet dan dunnage untuk meminimasi makespan
inferred← citeshttps://doi.org/10.3934/jimo.2024058openalex-snapshot
Comparison of lot streaming division methodologies for multi-objective hybrid flowshop scheduling problem by considering limited waiting time
inferred← citeshttps://doi.org/10.4067/s0718-07642018000600277openalex-snapshot
Medición de Tiempos en un Sistema de Distribución bajo un Estudio de Métodos y Tiempos
inferred← citeshttps://doi.org/10.55057/ijarei.2022.4.4.6openalex-snapshot
A Review of Scheduling Problems with Bounded Processing/Setup Times
inferred← citeshttps://doi.org/10.58837/chula.the.2019.1334openalex-snapshot
การจดตารางการผลตโดยวธการฮวรสตกส สำหรบกระบวนการบรรจยาสฟน
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.