All Stories

  1. A Comprehensive Benchmark of Constraint Programming Solvers for the Makespan-Minimisation Job Shop Scheduling Problem
  2. Optimal sizing and placement of hybrid PV-storage systems in microgrids using Bald Eagle Search Algorithm
  3. A Comprehensive Benchmark of Constraint Programming Solvers for the Makespan-Minimisation Job Shop Scheduling Problem
  4. 2024 and 2025 Selected Papers from Algorithms Editorial Board Members
  5. A three-stage algorithm for E-grocery demand forecasting using metaheuristic-driven high-order fuzzy cognitive maps and fractional brownian motion
  6. Special Issue “Selected 2024 and 2025 Papers from Algorithms Editorial Board Members”
  7. Velvet Worm Optimization: A Novel Bio-inspired Metaheuristic for Engineering Design Problems
  8. Single Machine Scheduling Problems: Standard Settings and Properties, Polynomially Solvable Cases, Complexity and Approximability
  9. Improving Supply Chain Performance by Production Scheduling in a Pharmaceutical Company
  10. Simulation and Modeling Methodologies, Technologies and Applications
  11. A review of challenges and solution approaches in smart manufacturing: a view on scheduling in the Industry 4.0 era
  12. Carpenter Optimization Algorithm: A Human-inspired Metaheuristic for Robust and Efficient Constrained Optimization
  13. Search and Rescue Algorithm (SRA): A Metaheuristic Approach for Efficient Constrained Engineering Optimization
  14. Detective Algorithm: A Novel Human-inspired Metaheuristic for Solving Real-world Constrained Optimization Problems
  15. Driver and Navigator Algorithm: A Novel Parameter-Free Human-inspired Metaheuristic for Efficient Global Optimization
  16. Psychologist Algorithm: A Human-inspired Metaheuristic for Solving Complex Constrained Optimization Problems
  17. Scheduling a single machine with compressible jobs to minimize maximum lateness
  18. On the Recursive Representation of the Permutation Flow and Job Shop Scheduling Problems and Some Extensions
  19. Salamander Optimization Algorithm: A New Bio-Inspired Approach for Solving Optimization Problems
  20. Combined heuristic-metaheuristic protocol for real-time clustering and routing in agricultural monitoring using UAV-assisted rechargeable WSNs
  21. Application of the Builder Optimization Algorithm for Sustainable Lot Size Optimization in Supply Chain Management: A Comprehensive Analysis and Comparison with Metaheuristic Approaches
  22. Orangutan Optimization Algorithm: An Innovative Bio-Inspired Metaheuristic Approach for Solving Engineering Optimization Problems
  23. Spider-Tailed Horned Viper Optimization: An Effective Bio-Inspired Metaheuristic Algorithm for Solving Engineering Applications
  24. Optimization Algorithms: Theory and Applications
  25. Scheduling Theory and Algorithms for Sustainable Manufacturing
  26. Special Issue: “Optimization Algorithms: Theory and Applications”
  27. Special Issue on Scheduling Theory and Algorithms for Sustainable Manufacturing
  28. MOCBOA: Multi-Objective Chef-Based Optimization Algorithm Using Hybrid Dominance Relations for Solving Engineering Design Problems
  29. Barber Optimization Algorithm: A New Human-Based Approach for Solving Optimization Problems
  30. Optimization of Reconfiguration and Resource Allocation for Distributed Generation and Capacitor Banks Using NSGA-II: A Multi-Scenario Approach
  31. Sales Training Based Optimization: A New Human-inspired Metaheuristic Approach for Supply Chain Management
  32. On the Recursive Representation of the Permutation Flow Shop Scheduling Problem and Its Extension
  33. UCapsNet: A Two-Stage Deep Learning Model Using U-Net and Capsule Network for Breast Cancer Segmentation and Classification in Ultrasound Imaging
  34. Fossa Optimization Algorithm: A New Bio-Inspired Metaheuristic Algorithm for Engineering Applications
  35. A Completely Different and Innovative Bio-Inspired Metaheuristic Approach for Effectively Solving Complex Optimization Problems Across Various Domains
  36. Connected and Autonomous Vehicle Scheduling Problems: Some Models and Algorithms
  37. Discrete Optimization: Theory, Algorithms, and Applications
  38. Mathematical Methods for Operations Research Problems
  39. Proceedings of the 14th International Conference on Simulation and Modeling Methodologies, Technologies and Applications
  40. Scheduling of Automated Wet-Etch Stations with One Robot in Semiconductor Manufacturing via Constraint Answer Set Programming
  41. Optimal Scheduling for Automated Wetetch Stations with One Robot in Semiconductor Manufacturing via Constraint Answer Set Programming
  42. Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations
  43. Recent Advances of Disсrete Optimization and Scheduling
  44. Frilled Lizard Optimization: A Novel Nature-Inspired Metaheuristic Algorithm for Solving Optimization Problems
  45. Special Issue “Recent Advances of Discrete Optimization and Scheduling”
  46. Special Issue: “2022 and 2023 Selected Papers from Algorithms’ Editorial Board Members”
  47. Ensemble Heuristic–Metaheuristic Feature Fusion Learning for Heart Disease Diagnosis Using Tabular Data
  48. Special issue "Discrete optimization: Theory, algorithms and new applications"
  49. Frilled Lizard Optimization: A Novel Bio-Inspired Optimizer for Solving Engineering Applications
  50. Magnificent Frigatebird Optimization: A New Bio-Inspired Metaheuristic Approach for Solving Optimization Problems
  51. GastroFuse-Net: an ensemble deep learning framework designed for gastrointestinal abnormality detection in endoscopic images
  52. A Heuristic Framework for Assessing the Efficiency of Multi-branch Banks Under Big Data Conditions
  53. Using the Novel Wolverine Optimization Algorithm for Solving Engineering Applications
  54. Simulation and Modeling Methodologies, Technologies and Applications
  55. A sustainable multi-objective model for the hazardous waste location-routing problem: A real case study
  56. EHMFFL: Ensemble Heuristic-Metaheuristic Feature Fusion Learning Algorithm for Heart Disease Diagnosis
  57. Acoustic Monitoring in Underwater Wireless Sensor Networks using Energy-efficient Artificial Fish Swarm-based Clustering Protocol (EAFSCP)
  58. Scheduling: Algorithms and Applications
  59. Proceedings of the 13th International Conference on Simulation and Modeling Methodologies, Technologies and Applications
  60. Special Issue “Scheduling: Algorithms and Applications”
  61. Mathematical Modeling and Exact Optimizing of University Course Scheduling Considering Preferences of Professors
  62. Mathematical Circuit Root Simplification Using an Ensemble Heuristic–Metaheuristic Algorithm
  63. Mathematical Modeling and Exact Optimizing of University Course Scheduling COnsidering Preferences of Professors
  64. Sustainable Phosphorus Fertilizer Supply Chain Management to Improve Crop Yield and P Use Efficiency Using an Ensemble Heuristic–Metaheuristic Optimization Algorithm
  65. Mathematical Root Simplification in Operational Amplifiers using an Ensemble Heuristic-Metaheuristic Algorithm
  66. Simulation and Modeling Methodologies, Technologies and Applications
  67. Simulation and Modeling Methodologies, Technologies and Applications
  68. LX-BBSCA: Laplacian biogeography-based sine cosine algorithm for structural engineering design optimization
  69. Designing a Renewable and Sustainable Phosphorus Fertilizer Supply Chain Network using an Ensemble Knowledge-based Heuristic-Metaheuristic Algorithm
  70. Solving train scheduling problems as a job shop: A brief review
  71. Social Media’s Role in Achieving Marketing Goals in Iran during the COVID-19 Pandemic
  72. Special Issue “1st Online Conference on Algorithms (IOCA2021)”
  73. Home Health Care Planning with the Consideration of Flexible Starting/Ending Points and Service Features
  74. Proceedings of the 12th International Conference on Simulation and Modeling Methodologies, Technologies and Applications
  75. The 1st International Electronic Conference on Algorithms
  76. The 1st International Electronic Conference on Algorithms (IOCA 2021)
  77. A robust optimization approach for a cellular manufacturing system considering skill-leveled operators and multi-functional machines
  78. Special Issue “2021 Selected Papers from Algorithms’ Editorial Board Members”
  79. A Stochastic Multi-Objective Model for a Sustainable Closed-Loop Supply Chain Network Design in the Automotive Industry
  80. Special Issue “Mathematical Methods for Operations Research Problems”
  81. Proceedings of the 11th International Conference on Simulation and Modeling Methodologies, Technologies and Applications
  82. Branch Less, Cut More and Schedule Jobs with Release and Delivery Times on Uniform Machines
  83. A Bi-Objective Home Health Care Routing and Scheduling Model with Considering Nurse Downgrading Costs
  84. 2020 Selected Papers from Algorithms’ Editorial Board Members
  85. A Polynomial Algorithm for Sequencing Jobs with Release and Delivery Times on Uniform Machines
  86. Multicriteria Optimization - Pareto-Optimality and Threshold-Optimality
  87. A Brief Look at Multi-Criteria Problems: Multi-Threshold Optimization versus Pareto-Optimization
  88. A Bi-Objective Home Health Care Routing and Scheduling Model with Considering Nurse Downgrading Costs
  89. Advances and Novel Approaches in Discrete Optimization
  90. Advances and Novel Approaches in Discrete Optimization
  91. A metric approach for scheduling problems with minimizing the maximum penalty
  92. On the Dual and Inverse Problems of Scheduling Jobs to Minimize the Maximum Penalty
  93. Graph-Theoretic Problems and Their New Applications
  94. Minimizing Total Weighted Tardiness for Scheduling Equal-Length Jobs on a Single Machine
  95. МИНИМИЗАЦИЯ СУММАРНОГО ВЗВЕШЕННОГО ЗАПАЗДЫВАНИЯ НА ОДНОМ ПРИБОРЕ С РАВНЫМИ ПРОДОЛЖИТЕЛЬНОСТЯМИ ОБСЛУЖИВАНИЯ ТРЕБОВАНИЙ
  96. Graph-Theoretic Problems and Their New Applications
  97. Exact and Heuristic Scheduling Algorithms
  98. A control approach to scheduling flexibly configurable jobs with dynamic structural-logical constraints
  99. Proactive Scheduling and Reactive Real-Time Control in Industry 4.0
  100. Polynomially Solvable Subcases for the Approximate Solution of Multi-machine Scheduling Problems
  101. Special Issue on Exact and Heuristic Scheduling Algorithms
  102. On Neighborhood Structures and Repair Techniques for Blocking Job Shop Scheduling Problems
  103. A genetic algorithm for total graph coloring
  104. Integrated detection of disruption scenarios, the ripple effect dispersal and recovery paths in supply chains
  105. Blockchain-oriented dynamic modelling of smart contract design and execution in the supply chain
  106. Editorial of a special issue
  107. Scheduling of operating rooms in hospitals
  108. Two-Machine Job-Shop Scheduling with Equal Processing Times on Each Machine
  109. Correction: Ungson, Y. et al. Filling of Irregular Channels with Round Cross-Section: Modeling Aspects to Study the Properties of Porous Materials. Materials 2018, 11, 1901
  110. The vehicle routing and scheduling problem with cross-docking for perishable products under uncertainty: Two robust bi-objective models
  111. Heuristic Algorithms to Maximize Revenue and the Number of Jobs Processed on Parallel Machines
  112. Minimizing the Makespan on Two Identical Parallel Machines with Mold Constraints
  113. ЭВРИСТИЧЕСКИЕ АЛГОРИТМЫ ДЛЯ МАКСИМИЗАЦИИ ДОХОДА И КОЛИЧЕСТВА ТРЕБОВАНИЙ, ОБСЛУЖИВАЕМЫХ НА ПАРАЛЛЕЛЬНЫХ ПРИБОРАХ
  114. On Scheduling Problems with Forbidden Stack-Overflows
  115. A Permutation-Based Heuristic Method for the Blocking Job Shop Scheduling Problem
  116. The Optimality Box and Region for Single-Machine Scheduling of a Set of Jobs with Uncertain Durations
  117. TIME RESTRICTION ASPECTS IN THE MODELING OF CYBER-PHYSICAL SYSTEMS FOR INDUSTRY 4.0
  118. COLLISIONS OF PARTICLES IN LIMITED SPACE ANALYZED BY MOLECULAR DYNAMICS METHODS
  119. Filling of Irregular Channels with Round Cross-Section: Modeling Aspects to Study the Properties of Porous Materials
  120. Editorial of a Special Issue
  121. Algorithms for Scheduling Problems
  122. A genetic algorithm for hybrid job-shop scheduling problems with minimizing the makespan or mean flow time
  123. This is the editorial of an open access special issue with 11 papers in the scheduling area.
  124. Incorporating supplier selection and order allocation into the vehicle routing and multi-cross-dock scheduling problem
  125. A Permutation-Based Neighborhood for the Blocking Job-Shop Problem with Total Tardiness Minimization
  126. Optimality box in uncertain data
  127. Flexible job shop scheduling with lot streaming and sublot size optimisation
  128. Material handling tools for a discrete manufacturing system: A comparison of optimization and simulation
  129. Approaches to modeling train scheduling problems as job-shop problems with blocking constraints
  130. A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of thresholds graphs
  131. A new effective dynamic program for an investment optimization problem
  132. Graphs with maximal induced matchings of the same size
  133. Integrated demand-responsive scheduling of maintenance and transportation operations in military supply chains
  134. Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
  135. Schedule robustness analysis with the help of attainable sets in continuous flow problem under capacity disruptions
  136. Recent advances on modelling of structures of multi-component mixtures using a sphere packing approach
  137. On a generalized single machine scheduling problem with time-dependent processing times**Supported by RFBR grants 13-01-12108, 15-07-07489, 15-07-03141 and DAAD grant A/1400328
  138. Tessellation for modeling
  139. Minimizing the makespan for the two-machine scheduling problem with a single server: Two algorithms for very large instances
  140. A dynamic model and an algorithm for short-term supply chain scheduling in the smart factory industry 4.0
  141. Corrigendum
  142. Minimising interference for scheduling two parallel machines with a single server
  143. Minimizing total weighted completion time approximately for the parallel machine problem with a single server
  144. Guest Editorial
  145. A new graphical approach for solving single-machine scheduling problems approximately
  146. Scheduling unrelated machines with two types of jobs
  147. A Graphical Approach to Solve an Investment Optimization Problem
  148. Simulated annealing and genetic algorithms for the two-machine scheduling problem with a single server
  149. Block models for scheduling jobs on two parallel machines with a single server
  150. Reducing efficiently the search tree for multiprocessor job-shop scheduling problems
  151. Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
  152. A note on the paper ‘Single machine scheduling problems with financial resource constraints: Some complexity results and properties’ by E.R. Gafarov et al.
  153. Erratum to: Minimizing total tardiness on parallel machines with preemptions
  154. Solving a job-shop scheduling problem by an adaptive algorithm based on learning
  155. The Stability Box for Minimizing Total Weighted Flow Time under Uncertain Data
  156. A Graphical Approach for Solving Single Machine Scheduling Problems Approximately
  157. Makespan Minimization for a Two-Machine Scheduling Problem with a Single Server
  158. Single machine total tardiness maximization problems: complexity and algorithms
  159. Measures of problem uncertainty for scheduling with interval processing times
  160. Guest Editorial
  161. Soft due window assignment and scheduling of unit-time jobs on parallel machines
  162. A Graphical Approach to Solve Combinatorial Problems: Algorithms and Some Computational Results
  163. A polynomially solvable case of a single machine scheduling problem when the maximal job processing time is a constant
  164. Calculation of the stability radius of an optimal line balance
  165. Near to Optimal Size Selection in Combinatorial Circuits
  166. Polynomial algorithms for scheduling jobs with two processing times on unrelated machines
  167. Search on the enumeration tree in the multiprocessor job-shop problem
  168. Graphs with Maximal Induced Matchings of the Same Size
  169. Approximability results for the resource-constrained project scheduling problem with a single type of resources
  170. Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
  171. A note on a single machine scheduling problem with generalized total tardiness objective function
  172. The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
  173. The complexity of dissociation set problems in graphs
  174. Single machine scheduling problems with financial resource constraints: Some complexity results and properties
  175. Parallel machine problems with equal processing times: a survey
  176. Batching for work and rework processes on dedicated facilities to minimize the makespan
  177. Algorithms for some maximization scheduling problems on a single machine
  178. Minimizing total weighted completion time with uncertain data: A stability approach
  179. Scheduling with multiple servers
  180. Foreword to the thematical issue devoted to the seventieth anniversary of Academician V.S. Tanaev
  181. Minimizing total tardiness on parallel machines with preemptions
  182. Minimizing the number of machines for scheduling jobs with equal processing times
  183. Preemptive scheduling on uniform machines to minimize mean flow time
  184. A graphical realization of the dynamic programming method for solving
  185. Algorithms for special cases of the single machine total tardiness problem and an application to the even–odd partition problem
  186. A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
  187. On a parallel machine scheduling problem with equal processing times
  188. Hierarchical Scheduling of Mobile Robots in Production-Transportation Supply Chains
  189. On the Complexity of Dissociation Set Problems in Graphs
  190. Partial job order for solving the two-machine flow-shop minimum-length problem with uncertain processing times
  191. Scheduling Jobs with Equal Processing Times
  192. Hamiltonian properties of triangular grid graphs
  193. Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
  194. Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
  195. Using Simulated Annealing for Open Shop Scheduling with Sum Criteria
  196. Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
  197. Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
  198. Problem F2∥Cmax with forbidden jobs in the first or last position is easy
  199. Complexity of shop-scheduling problems with fixed number of jobs: a survey
  200. A note on the two machine job shop with the weighted late work criterion
  201. Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables
  202. Batching work and rework processes with limited deterioration of reworkables
  203. Mathematics of Economics and Business
  204. Book Review: Michael L. Pinedo (2005): ISBN 0-387-22198-0, Springer, New York
  205. SEQUENCE-DEPENDENT SETUP AND CLEAN-UP TIMES IN A TWO-MACHINE JOB-SHOP WITH MINIMIZING MAKESPAN
  206. A COMPARISON OF HEURISTICS FOR MEAN FLOW TIME OPEN SHOP SCHEDULING
  207. A comparison of solution procedures for two-machine flow shop scheduling with late work criterion
  208. The two-machine flow-shop problem with weighted late work criterion and common due date
  209. Positive half-products and scheduling with controllable processing times
  210. Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date
  211. Mean flow time minimization with given bounds of processing times
  212. Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey
  213. On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
  214. Open shop scheduling problems with late work criteria
  215. Two-Machine Flow Shop Scheduling with Nonregular Criteria
  216. Flow Shop Scheduling with Late Work Criterion – Choosing the Best Solution Strategy
  217. Two-machine open shop scheduling with secondary criteria
  218. Heuristics for hybrid flow shops with controllable processing times and assignable due dates
  219. Scheduling Problems and Mixed Graph Colorings
  220. Local search heuristics for two-stage flow shop problems with secondary criterion
  221. Complexity results for parallel machine problems with a single server
  222. A heuristic algorithm for minimizing mean flow time with unit setups
  223. Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
  224. Minimizing total flow time in a two-machine flowshop problem with minimum makespan
  225. Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals
  226. Complexity of mixed shop scheduling problems: A survey
  227. On the Solution of 2-Machine Flow Shop Problems With a Common Due Date
  228. Scheduling with Deadlines and Nested Processing Intervals for a Single Machine
  229. Total Late Work Criteria for Shop Scheduling Problems
  230. A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
  231. On the application of insertion techniques for job shop problems with setup times
  232. Heuristics for generalized shop scheduling problems based on decomposition
  233. Stability Radius of an Optimal Schedule: A Survey and Recent Developments
  234. Parallel machine scheduling problems with a single server
  235. Optimal makespan scheduling with given bounds of processing times
  236. Stability of an optimal schedule in a job shop
  237. A polynomial approximation scheme for problem F2/rj/Cmax
  238. Improving local search heuristics for some scheduling problems. Part II
  239. Single machine scheduling with deadlines, release and due dates
  240. Stability of a schedule minimizing mean flow time
  241. Heuristics for permutation flow shop scheduling with batch setup times
  242. Improving local search heuristics for some scheduling problems—I
  243. Adaptive scheduling algorithm based on mixed graph model
  244. Book reviews
  245. Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times
  246. A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs
  247. A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs
  248. A polynomial algorithm for an open shop problem with unit processing times and tree constraints
  249. Insertion techniques for the heuristic solution of the job shop problem
  250. On the solution of determinantal systems of linear inequalities
  251. Optimal schedules with infinitely large stability radius∗
  252. A strongly polynomial algorithm for a new class of linear inequalities1
  253. single Machine Preemptive Scheduling With Special Cost Functions1
  254. Book reviews
  255. A polynomial algorithm for the [n/m/0, tij = 1, tree/Cmax] open shop problem
  256. Scheduling unit time open shops to minimize the weighted number of late jobs
  257. On the heuristic solution of the permutation flow shop problem by path algorithms
  258. Constructive heuristic algorithms for the open shop problem
  259. A branch and bound algorithm for minimizing weighted completion times with deadlines
  260. On the combinatorial structure of the permutation flow shop problem
  261. Some relations between neighbourhood graphs for a permutation problem
  262. A locally optimal insertion heuristic for a one-machine scheduling problem
  263. Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme
  264. On the method of interchanging networks for permutation problems
  265. The job - shop problem - modelling by latin rectangles, exact and heuristic solution
  266. Stability of Optimal Line Balance with Given Station Set
  267. Parallel scheduling algorithm to minimize maximal cost