A hybrid method for the planning and scheduling
type: Item
instance of: scholarly article
title: A hybrid method for the planning and scheduling
zbMATH Open document ID: 1122.90054
published in: Constraints
publication date: 2006-11-03T00:00:00Z
full work available at URL: https://figshare.com/articles/journal_contribution/A_Hybrid_Method_for_Planning_and_Scheduling/6703013
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5070681
zbMATH Keywords: hybrid methods
zbMATH Keywords: planning and scheduling
zbMATH Keywords: Bender's decomposition
author: John N. Hooker
MaRDI profile type: Publication
OpenAlex ID: W2045994923
cites work: Constraint-based scheduling: Applying constraint programming to scheduling problems.
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: Q4475617
cites work: Generalized Benders decomposition
cites work: Q4523706
cites work: Logic-based Benders decomposition
cites work: Algorithms for hybrid MILP/CP models for a class of optimization problems
cites work: Q4475618
DOI: 10.1007/S10601-005-2812-2
description: scientific article; zbMATH DE number 5070681