All Stories

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