scientific article; zbMATH DE number 778449

MaRDI QIDQ4841773zbMATH OpenFDO

Authors Bronisław Florkiewicz, Michał Kulej

Publication date 21 August 1995

zbMATH Keywords

minimal time schedulesnecessary and sufficient conditionsnon-simplex methodtime window constraintsvehicle routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 4047422
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• scientific article; zbMATH DE number 4047423
• A way to optimally solve a time-dependent vehicle routing problem with time windows
• scientific article; zbMATH DE number 1195627
• Vehicle routing and scheduling with time windows
• scientific article; zbMATH DE number 3985132
• The vehicle routing problem with time windows and temporal dependencies
• The vehicle routing problem with flexible time windows and traveling times

Cited in

(7)

• Single-vehicle scheduling with time window constraints
• Integrated machine scheduling and vehicle routing with time windows
• Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
• scientific article; zbMATH DE number 4047422 (Why is no real title available?)
• Optimal vehicle routing with lower and upper bounds on route durations
• scientific article; zbMATH DE number 1452994 (Why is no real title available?)
• Using constraint-based operators to solve the vehicle routing problem with time windows

This page was built for publication:

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