A case study of mutual routing-scheduling reformulation
type: Item
instance of: scholarly article
title: A case study of mutual routing-scheduling reformulation
zbMATH Open document ID: 1154.90412
author: J. Christopher Beck
author: Patrick Prosser
author: Evgeny Selensky
published in: Journal of Scheduling
publication date: 2007-05-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5153377
zbMATH Keywords: job shop scheduling
zbMATH Keywords: vehicle routing
zbMATH Keywords: problem reformulation
zbMATH Keywords: empirical analysis
describes a project that uses: ILOG SCHEDULE
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: s10951-006-8596-4
OpenAlex ID: W2010898123
cites work: Constraint-based scheduling: Applying constraint programming to scheduling problems.
cites work: Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
cites work: A hybrid approach to scheduling with earliness and tardiness costs
cites work: Q4737601
cites work: Q4438765
cites work: A constraint-based method for project scheduling with time windows
cites work: Solving vehicle routing problems using constraint programming and metaheuristics
cites work: Q4692609
cites work: Q4198056
cites work: A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints
cites work: Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
cites work: Q4849545
cites work: Q4495205
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: Guided local search joins the elite in discrete optimisation
cites work: Q4536728
DOI: 10.1007/S10951-006-8596-4
description: scientific article; zbMATH DE number 5153377