All Stories

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