An improved discrete optimisation procedure with comparison to constraint programming

DOI10.1007/978-3-031-97077-1_19MaRDI QIDQ6884678zbMATH OpenFDO

Authors Hayden Merrick, Julia Memar, Hanyu Gu

Publication date 15 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-97077-1_19

zbMATH Keywords

constraint programmingdiscrete optimisationexact algorithmscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cites work

• A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs
• A comparison of list schedules for parallel processing systems
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• Comparison of MILP and CP models for balancing partially automated assembly lines
• Complexity of Scheduling under Precedence Constraints
• Discrete optimization with polynomially detectable boundaries and restricted level sets
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 473381 (Why is no real title available?)
• IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
• Lower bounds for parallel machine scheduling problems
• Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook
• NP-complete scheduling problems
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• Scheduling Tasks with Nonuniform Deadlines on Two Processors
• Scheduling UET-UCT tasks: Branch-and-bound search in the priority space
• Scheduling. Theory, algorithms, and systems

This page was built for publication: An improved discrete optimisation procedure with comparison to constraint programming

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