Enhancing the best-first-search F with incremental search and restarts for large-scale single machine scheduling with release dates and deadlines

DOI10.1007/S10479-024-06386-7MaRDI QIDQ6945285zbMATH OpenFDO

Authors Y. Laalaoui, Rym M'Hallah

Publication date 9 August 2025

Published in Annals of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10479-024-06386-7

zbMATH Keywords

\(\mathrm{F}\) heuristic searchdeadlinesincremental searchrelease datesrestartsscheduling

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A hybrid method for large-scale short-term scheduling of make-and-pack production processes
• A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
• A multi-agent system for the weighted earliness tardiness parallel machine problem
• A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty
• Algorithms for large scale shift minimisation personnel task scheduling problems
• Approximate and robust bounded job start scheduling for Royal Mail delivery offices
• Backjump-based backtracking for constraint satisfaction problems
• Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
• Conflict-directed backjumping revisited
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling
• Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system
• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 1305705 (Why is no real title available?)
• Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders
• Metaheuristics for solving a flexible flow-shop scheduling problem with s-batching machines
• Minimizing the weighted number of tardy jobs on a single machine with release dates
• New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem
• Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Reasoning from last conflict(s) in constraint programming
• Resource-constrained project scheduling: A heuristic for the multi-mode case
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• Server cloud scheduling
• Supply chain scheduling: sequence coordination

Cited in

(1)

• Minimizing the weighted makespan with restarts on a single machine

This page was built for publication: Enhancing the best-first-search \(\mathrm{F}\) with incremental search and restarts for large-scale single machine scheduling with release dates and deadlines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6945285)