Constraint programming model and biased random-key genetic algorithm for the single-machine coupled task scheduling problem with exact delays to minimize the makespan

Documenti analoghi

• The pickup and delivery problem with time windows and scheduling on the edges
  di: Barbosa, Vítor A., et al.
  Pubblicazione: (2025)
• Revisiting Johnson's rule for minimizing makespan in the Two-Machine Flow Shop scheduling problem
  di: Della Croce, Federico, et al.
  Pubblicazione: (2025)
• The connected Grundy coloring problem: Formulations and a local-search enhanced biased random-key genetic algorithm
  di: Silva, Mateus C., et al.
  Pubblicazione: (2024)
• Approximation algorithms for coupled task scheduling minimizing the sum of completion times
  di: Fischer, David, et al.
  Pubblicazione: (2022)
• Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
  di: Bouška, Michal, et al.
  Pubblicazione: (2024)