An Improved Discrete Optimisation Procedure with Comparison to Constraint Programming
- 6 July 2025
- book chapter
- Published by Springer Nature
- p. 270-285
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costsEuropean Journal of Operational Research, 2024
- Fast scheduling of human-robot teams collaboration on synchronised production-logistics tasks in aircraft assemblyRobotics and Computer-Integrated Manufacturing, 2023
- A branch and bound algorithm for a parallel machine scheduling problem in green manufacturing industry considering time cost and power consumptionJournal of Cleaner Production, 2021
- IBM ILOG CP optimizer for schedulingConstraints, 2018
- Search Strategies for Problems with Detectable Boundaries and Restricted Level Sets2017
- Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruningDiscrete Optimization, 2016
- Discrete optimization with polynomially detectable boundaries and restricted level setsJournal of Combinatorial Optimization, 2012
- Scheduling UET-UCT tasks: branch-and-bound search in the priority spaceOptimization and Engineering, 2009
- Mixed integer programming formulations for single machine scheduling problemsComputers & Industrial Engineering, 2009
- Scheduling jobs with release dates and tails on identical machines to minimize the makespanEuropean Journal of Operational Research, 1987