On the public citation graph

An Exact Method for Solving the Multi-Processor Flow-Shop

https://doi.org/10.1051/ro:2000103
0 signed · 127 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 points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4600334openalex-extracted
A Two-Stage Cross Neighborhood Search Algorithm Bridging Different Solution Representation Spaces for Solving the Hybrid Flow Shop Scheduling Problem
inferred← citeshttps://doi.org/10.2139/ssrn.4600335openalex-extracted
A Two-Stage Cross Neighborhood Search Algorithm Bridging Different Solution Representation Spaces for Solving the Hybrid Flow Shop Scheduling Problem
inferred← citeshttps://doi.org/10.2139/ssrn.4679406openalex-extracted
inferred← citeshttps://doi.org/10.1002/9780470611050.ch9openalex-snapshot
Shop Scheduling with Multiple Resources
inferred← citeshttps://doi.org/10.1007/3-540-44629-x_17openalex-snapshot
Resource-Constrained Project Scheduling and Timetabling
inferred← citeshttps://doi.org/10.1007/978-3-030-67163-1_5openalex-snapshot
Metaheuristics in Modeling Humanoid Robots: A Literature Review
inferred← citeshttps://doi.org/10.1007/978-3-030-82397-9_7openalex-snapshot
Approximation and Exact Algorithms for Multiprocessor Scheduling Problem with Release and Delivery Times
inferred← citeshttps://doi.org/10.1007/978-3-030-85626-7_73openalex-snapshot
Fuzzy Hybrid Flow Shop Scheduling Problem: An Application
inferred← citeshttps://doi.org/10.1007/978-3-031-30351-7_21openalex-snapshot
Towards Viable Modelling for Robust Flow Shop Scheduling in Production Environments Under Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-319-28555-9_5openalex-snapshot
An Integrated Declarative Approach to Decision Support for Scheduling Groups of Jobs
inferred← citeshttps://doi.org/10.1007/978-3-540-32220-7_8openalex-snapshot
Flow Shop Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-37105-9_33openalex-snapshot
An Improved Discrete Artificial Bee Colony Algorithm for Hybrid Flow Shop Problems
inferred← citeshttps://doi.org/10.1007/978-981-99-6987-6_4openalex-snapshot
Green Scheduling in Hybrid Flow Shop Environment
inferred← citeshttps://doi.org/10.1007/978-981-99-8819-8_34openalex-snapshot
Solving Makespan and Energy Utilization in Hybrid Flow Shop Scheduling Problem Using Artificial Bee Colony (ABC)
inferred← citeshttps://doi.org/10.1007/s00170-007-1048-2openalex-snapshot
Using ant colony optimization to solve hybrid flow shop scheduling problems
inferred← citeshttps://doi.org/10.1007/s00170-013-4819-yopenalex-snapshot
An enhanced estimation of distribution algorithm for solving hybrid flow-shop scheduling problem with identical parallel machines
inferred← citeshttps://doi.org/10.1007/s00170-014-6195-7openalex-snapshot
A novel genetic algorithm for the hybrid flow shop scheduling with parallel batching and eligibility constraints
inferred← citeshttps://doi.org/10.1007/s00186-006-0066-4openalex-snapshot
Optimal Scheduling of a Two-stage Hybrid Flow Shop
inferred← citeshttps://doi.org/10.1007/s00500-018-3447-8openalex-snapshot
A multi-objective migrating birds optimization algorithm for the hybrid flowshop rescheduling problem
inferred← citeshttps://doi.org/10.1007/s00500-023-09086-9openalex-snapshot
Constraint programming models for the hybrid flow shop scheduling problem and its extensions
inferred← citeshttps://doi.org/10.1007/s10479-005-2443-4openalex-snapshot
Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis
inferred← citeshttps://doi.org/10.1007/s10586-019-03022-zopenalex-snapshot
A hybrid multi-objective artificial bee colony algorithm for flexible task scheduling problems in cloud computing system
inferred← citeshttps://doi.org/10.1007/s10852-008-9101-1openalex-snapshot
Hybrid Flow-Shop: a Memetic Algorithm Using Constraint-Based Scheduling for Efficient Search
inferred← citeshttps://doi.org/10.1007/s40092-017-0244-4openalex-snapshot
Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
inferred← citeshttps://doi.org/10.1007/s40747-025-01993-8openalex-snapshot
Multi-attribute bottleneck identification method for hybrid flow shops in panel furniture intelligent manufacturing
inferred← citeshttps://doi.org/10.1007/s44444-026-00128-9openalex-snapshot
Routing under machine breakdowns: a benchmark of dispatching rules, bandits, and reinforcement learning for multi-server flow shops
inferred← citeshttps://doi.org/10.1016/j.amc.2011.02.108openalex-snapshot
Bounding strategies for the hybrid flow shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2012.01.011openalex-snapshot
An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2013.03.006openalex-snapshot
An immunoglobulin-based artificial immune system for solving the hybrid flow shop problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2014.07.005openalex-snapshot
A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2016.12.021openalex-snapshot
An effective modified migrating birds optimization for hybrid flowshop scheduling problem with lot streaming
inferred← citeshttps://doi.org/10.1016/j.asoc.2018.11.043openalex-snapshot
A multi-objective cellular grey wolf optimizer for hybrid flowshop scheduling problem considering noise pollution
inferred← citeshttps://doi.org/10.1016/j.asoc.2026.116085openalex-snapshot
Efficient and generalized scheduling for flow shops via contention-aware graph meta-reinforcement learning
inferred← citeshttps://doi.org/10.1016/j.cie.2017.10.034openalex-snapshot
Efficient heuristics for the hybrid flow shop scheduling problem with missing operations
inferred← citeshttps://doi.org/10.1016/j.cie.2019.07.036openalex-snapshot
A multiobjective evolutionary algorithm based on decomposition for hybrid flowshop green scheduling problem
inferred← citeshttps://doi.org/10.1016/j.cie.2019.07.041openalex-snapshot
Memetic algorithm for solving flexible flow-shop scheduling problems with dynamic transport waiting times
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.2023.109802openalex-snapshot
The application of heterogeneous graph neural network and deep reinforcement learning in hybrid flow shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.cie.2024.110324openalex-snapshot
An improved co-evolutionary memetic algorithm based on novel schedule type and unconditional feasibility for hybrid flow-shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.cie.2026.111969openalex-snapshot
Efficient lower bounds and heuristics for a symmetric two-stage hybrid flow shop with release dates, transportation, and delivery times
inferred← citeshttps://doi.org/10.1016/j.cor.2005.05.012openalex-snapshot
An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1016/j.cor.2012.11.009openalex-snapshot
Three-stage hybrid-flowshop model for cross-docking
inferred← citeshttps://doi.org/10.1016/j.cor.2013.02.016openalex-snapshot
Taking advantage of a diverse set of efficient production schedules: A two-step approach for scheduling with side concerns
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.2019.06.009openalex-snapshot
Metaheuristic algorithms for the hybrid flowshop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106783openalex-snapshot
A path relinking with tabu search algorithm for solving hybrid flow shop scheduling problem considering multiple critical paths
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.dam.2004.12.003openalex-snapshot
Optimal parallel machines scheduling with availability constraints
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.12.026openalex-snapshot
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.01.042openalex-snapshot
A taxonomy of flexible flow line scheduling procedures
inferred← citeshttps://doi.org/10.1016/j.ejor.2009.09.024openalex-snapshot
The hybrid flow shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.10.004openalex-snapshot
Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems
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.engappai.2025.112096openalex-snapshot
A deep reinforcement learning optimization algorithm based on heterogeneous graph neural network for hybrid flow shop scheduling problem with finite transportation resources
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.2021.115422openalex-snapshot
New benchmark algorithm for hybrid flowshop scheduling with identical machines
inferred← citeshttps://doi.org/10.1016/j.eswa.2024.125026openalex-snapshot
Theoretical analysis and implementation of mandatory operations-based accelerated search in graph space for hybrid flow shop scheduling
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.126955openalex-snapshot
Greedy-assisted teaching-learning-based optimization algorithm for cost-based hybrid flow shop scheduling
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.future.2004.03.014openalex-snapshot
A new approach to solve hybrid flow shop scheduling problems by artificial immune system
inferred← citeshttps://doi.org/10.1016/j.ins.2014.02.152openalex-snapshot
An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation
inferred← citeshttps://doi.org/10.1016/j.jclepro.2017.05.113openalex-snapshot
Production-inventory-routing coordination with capacity and time window constraints for perishable products: Heuristic and meta-heuristic algorithms
inferred← citeshttps://doi.org/10.1016/j.jclepro.2018.02.004openalex-snapshot
Efficient multi-objective optimization algorithm for hybrid flow shop scheduling problems with setup energy consumptions
inferred← citeshttps://doi.org/10.1016/j.neucom.2013.07.056openalex-snapshot
An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems
inferred← citeshttps://doi.org/10.1016/j.omega.2013.12.004openalex-snapshot
A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation
inferred← citeshttps://doi.org/10.1016/j.proeng.2014.12.230openalex-snapshot
A Survey on Occurrence of Critical Machines in a Manufacturing Environment
inferred← citeshttps://doi.org/10.1016/j.swevo.2020.100660openalex-snapshot
Ensemble of metaheuristics for energy-efficient hybrid flowshops: Makespan versus total energy consumption
inferred← citeshttps://doi.org/10.1016/j.swevo.2023.101455openalex-snapshot
A two-stage cross-neighborhood search algorithm bridging different solution representation spaces for solving the hybrid flow shop scheduling problem
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/s0167-6377(01)00104-3openalex-snapshot
List scheduling in a parallel machine environment with precedence constraints and setup times
inferred← citeshttps://doi.org/10.1016/s0305-0483(01)00040-8openalex-snapshot
Solving hybrid flow shop problem using energetic reasoning and global operations
inferred← citeshttps://doi.org/10.1080/00207543.2026.2738928openalex-snapshot
Multi-objective energy-efficient flexible flow shop scheduling problem: integrating renewable energy and demand response programs
inferred← citeshttps://doi.org/10.1080/0305215x.2012.737784openalex-snapshot
An effective shuffled frog-leaping algorithm for solving the hybrid flow-shop scheduling problem with identical parallel machines
inferred← citeshttps://doi.org/10.1080/0951192x.2011.575181openalex-snapshot
A genetic algorithm for robust hybrid flow shop scheduling
inferred← citeshttps://doi.org/10.1080/18756891.2008.9727611openalex-snapshot
An Application Of Effective Genetic Algorithms For Solving Hybrid Flow Shop Scheduling Problems
inferred← citeshttps://doi.org/10.1080/21681015.2023.2276108openalex-snapshot
Cost-based hybrid flow shop scheduling with uniform machine optimization using an improved tiki-taka algorithm
inferred← citeshttps://doi.org/10.1088/1742-6596/2787/1/012058openalex-snapshot
Research on the scheduling of steel mesh production line based on the improved grey wolf algorithm
inferred← citeshttps://doi.org/10.1109/access.2020.2999680openalex-snapshot
Research on Multi-Objective Hybrid Flow Shop Scheduling Problem With Dual Resource Constraints Using Improved Memetic Algorithm
inferred← citeshttps://doi.org/10.1109/access.2023.3268214openalex-snapshot
An Evaluation of Mathematical Programming and Lower-Bound Methods for Hybrid Flow Shop Problems With a Makespan Criterion
inferred← citeshttps://doi.org/10.1109/ccdc69976.2026.11559643openalex-snapshot
Multi Strategy Fusion Firefly Algorithm for Hybrid Flow Shop Scheduling Problem
inferred← citeshttps://doi.org/10.1109/cec.2007.4424962openalex-snapshot
An investigation of hyper-heuristic search spaces
inferred← citeshttps://doi.org/10.1109/cec.2009.4983169openalex-snapshot
Dispatching rules for production scheduling: A hyper-heuristic landscape analysis
inferred← citeshttps://doi.org/10.1109/cipls.2014.7007156openalex-snapshot
An iterated greedy algorithm for the hybrid flowshop problem with makespan criterion
inferred← citeshttps://doi.org/10.1109/cost57098.2022.00087openalex-snapshot
Improved TPX based IAGA for solving hybrid flow-shop scheduling problem with identical parallel machine
inferred← citeshttps://doi.org/10.1109/cscwd.2016.7565994openalex-snapshot
Differential evolution algorithm with variable neighborhood search for hybrid flow shop scheduling problem
inferred← citeshttps://doi.org/10.1109/cvidliccea56201.2022.9824804openalex-snapshot
Improved Simulated Annealing Algorithm for the Scheduling of Hybrid Flow-shop Problem
inferred← citeshttps://doi.org/10.1109/fskd.2017.8393402openalex-snapshot
An effective fruit fly optimization algorithm for the hybrid flowshop scheduling problem
inferred← citeshttps://doi.org/10.1109/iccie.2009.5223779openalex-snapshot
An integrated ant colony optimization algorithm for the hybrid flow shop scheduling problem
inferred← citeshttps://doi.org/10.1109/icmic.2017.8321633openalex-snapshot
Improved imperialist competitive algorithm for flexible flow shop scheduling
inferred← citeshttps://doi.org/10.1109/icmic.2017.8321635openalex-snapshot
Feature selection for risk detection of strokes: A 5-year longitudinal study
inferred← citeshttps://doi.org/10.1109/icmic.2018.8529921openalex-snapshot
Research on Flexible Flow Shop Scheduling Problem with Variable Processing Times
inferred← citeshttps://doi.org/10.1109/icmss.2009.5301354openalex-snapshot
Genetic Algorithm for Minimizing the Makespan in Hybrid Flow Shop Scheduling Problem
inferred← citeshttps://doi.org/10.1109/icnsc55942.2022.10004154openalex-snapshot
Constraint Programming for Modeling and Solving a Hybrid Flow Shop Scheduling Problem
inferred← citeshttps://doi.org/10.1109/icsssm.2006.320665openalex-snapshot
Adaptation of Discrepancy-based Methods for Solving Hybrid Flow Shop Problems
inferred← citeshttps://doi.org/10.1109/icsssm.2006.320684openalex-snapshot
Using Genetic Algorithm in the Multiprocessor Flow Shop to Minimize the Makespan
inferred← citeshttps://doi.org/10.1109/iscaie47305.2020.9108829openalex-snapshot
Optimisation of Energy Efficient Hybrid Flowshop Scheduling Problem using Firefly Algorithm
inferred← citeshttps://doi.org/10.1109/mdm55031.2022.00104openalex-snapshot
Material Transfer Planning for Huge warship: Modeling, Simulation, and Evaluation
inferred← citeshttps://doi.org/10.1109/tcyb.2021.3120875openalex-snapshot
A Hybrid Evolutionary Algorithm Using Two Solution Representations for Hybrid Flow-Shop Scheduling Problem
inferred← citeshttps://doi.org/10.1111/itor.70189openalex-snapshot
Energy‐aware scheduling in a flexible flow shop using a hybrid constraint programming approach
inferred← citeshttps://doi.org/10.1145/3205455.3205500openalex-snapshot
Iterated greedy algorithms for the hybrid flowshop scheduling with total flow time minimization
inferred← citeshttps://doi.org/10.1155/2014/596850openalex-snapshot
Hybrid Particle Swarm Optimization for Hybrid Flowshop Scheduling Problem with Maintenance Activities
inferred← citeshttps://doi.org/10.1186/s40537-025-01085-xopenalex-snapshot
A novel artificial intelligence search algorithm and mathematical model for the hybrid flow shop scheduling problem
inferred← citeshttps://doi.org/10.1371/journal.pone.0330020openalex-snapshot
Solving multi-scenario hybrid flow shop scheduling problem based on an improved probe machine model
inferred← citeshttps://doi.org/10.14488/1676-1901.v16i1.1720openalex-snapshot
Efeitos de regras de prioridade para programação da produção em sistemas industriais complexos
inferred← citeshttps://doi.org/10.1504/ejie.2007.014110openalex-snapshot
Climbing depth-bounded discrepancy search for solving hybrid flow shop problems
inferred← citeshttps://doi.org/10.15282/ijame.20.4.2023.05.0840openalex-snapshot
Hybrid Flow Shop Scheduling Problem with Energy Utilization using Non-Dominated Sorting Genetic Algorithm-III (NSGA-III) Optimization
inferred← citeshttps://doi.org/10.17485/ijst/2015/v8i35/79530openalex-snapshot
Single Objective for Partial Flexible Open Shop Scheduling Problem using Hybrid Particle Swarm Optimization Algorithms
inferred← citeshttps://doi.org/10.2991/icmia-17.2017.123openalex-snapshot
Migrating birds optimization for hybrid flow shop scheduling problem with makespan
inferred← citeshttps://doi.org/10.2991/icmii-15.2015.28openalex-snapshot
Genetic Algorithm with Direction Selection for the Hybrid Flow Shop Scheduling Problem with makespan minimization
inferred← citeshttps://doi.org/10.2991/icsmim-15.2016.92openalex-snapshot
An Effective Local Search for Hybrid Flow Shop Scheduling Problems
inferred← citeshttps://doi.org/10.2991/ijcis.2008.1.2.4openalex-snapshot
An application of effective genetic algorithms for Solving Hybrid Flow Shop Scheduling Problems
inferred← citeshttps://doi.org/10.2991/jnmp.2008.1.2.4openalex-snapshot
An application of effective genetic algorithms for Solving Hybrid Flow Shop Scheduling Problems
inferred← citeshttps://doi.org/10.33693/2313-223x-2024-11-2-58-85openalex-snapshot
Modification of a Quantum-inspired Genetic Algorithm for Numerical Optimization Using Qudit under Conditions of Simulating Quantum Decoherence
inferred← citeshttps://doi.org/10.3390/app10186220openalex-snapshot
Improved SP-MCTS-Based Scheduling for Multi-Constraint Hybrid Flow Shop
inferred← citeshttps://doi.org/10.3390/app13063563openalex-snapshot
Multi-Objective Hybrid Flow-Shop Scheduling in Parallel Sequential Mode While Considering Handling Time and Setup Time
inferred← citeshttps://doi.org/10.3390/app13095701openalex-snapshot
Research on Production Scheduling Technology in Knitting Workshop Based on Improved Genetic Algorithm
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/pr13092930openalex-snapshot
Solving the Scheduling Problem in the Electrical Panel Board Manufacturing Industry Using a Hybrid Atomic Orbital Search Optimization Algorithm
inferred← citeshttps://doi.org/10.3390/pr7100681openalex-snapshot
Flexible Flow Shop Scheduling Method with Public Buffer
inferred← citeshttps://doi.org/10.4018/978-1-4666-2145-9.ch006openalex-snapshot
An Ant Colony System Algorithm for the Hybrid Flow-Shop Scheduling Problem
inferred← citeshttps://doi.org/10.4018/978-1-5225-5134-8.ch015openalex-snapshot
Using Cuckoo Search Algorithm for Hybrid Flow Shop Scheduling Problems Under Makespan Criterion
inferred← citeshttps://doi.org/10.4018/jamc.2011010103openalex-snapshot
An Ant Colony System Algorithm for the Hybrid Flow-Shop Scheduling Problem
inferred← citeshttps://doi.org/10.5204/thesis.eprints.237963openalex-snapshot
A multi objective approach for creating robust flowshop schedules with buffering constraints
inferred← citeshttps://doi.org/10.56225/ijgoia.v2i4.265openalex-snapshot
Modeling and Optimization of Cost-Based Hybrid Flow Shop Scheduling Problem using Metaheuristics
inferred← citeshttps://doi.org/10.70675/0ac504c8zfb54z44caz892bz7b9f3ce35766openalex-snapshot
Geometric and Dual Approaches to Cumulative Scheduling
inferred← citeshttps://doi.org/10.70675/f6aafabbz36f6z46ccz8e9cz5d5894ba1d2copenalex-snapshot
Approche générique pour la prise de décisions multi-niveaux, contribution à la gestion des systèmes de production de soins en réseau
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.