All Stories

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