All Stories

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