Reformulating linear programs with transportation constraints-With applications to workforce scheduling

DOI10.1002/nav.10115zbMath1056.90008OpenAlexW1589496146MaRDI QIDQ4651722

Mehmet Tolga Çezik, Oktay Günlük

Publication date: 22 February 2005

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.10115

zbMATH Keywords

linear programmingtransportation problemworkforce scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (5)

An implicit model for multi-activity shift scheduling problems ⋮ The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers ⋮ Solution approaches to large shift scheduling problems ⋮ Bechtold-Jacobs generalized model for shift scheduling with extraordinary overlap ⋮ Implicit shift scheduling with multiple breaks and work stretch duration restrictions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theorem on flows in networks
• Monge sequences, antimatroids, and the transportation problem with forbidden arcs
• An integer programming model for the weekly tour scheduling problem
• The perfectly matchable subgraph polytope of a bipartite graph
• Longitudinal manpower planning models
• Improved Algorithms for Bipartite Network Flow
• Improved Implicit Optimal Modeling of the Labor Shift Scheduling Problem
• Maximum matching in a convex bipartite graph

This page was built for publication: Reformulating linear programs with transportation constraints-With applications to workforce scheduling