All Stories

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