A model for bus crew scheduling problem with multiple duty types

DOI10.1155/2012/649213zbMath1248.90047OpenAlexW2028617620WikidataQ58700680 ScholiaQ58700680MaRDI QIDQ714275

Mingming Chen, Huimin Niu

Publication date: 19 October 2012

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/649213

zbMATH Keywords

bus crew scheduling problem

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Optimizing schedules of rail train circulations by tabu search algorithm

Cites Work

• An extension of set partitioning with application to scheduling problems
• A tree search algorithm for the crew scheduling problem
• A dynamic programming based algorithm for the crew scheduling problem.
• Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
• A Column Generation Approach to the Urban Transit Crew Scheduling Problem
• Multiobjective Metaheuristics for the Bus Driver Scheduling Problem

This page was built for publication: A model for bus crew scheduling problem with multiple duty types