All Stories

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