All Stories

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