Scheduling cleaning activities on trains by minimizing idle times

DOI10.1007/S10951-017-0517-1zbMath1391.90240DBLPjournals/scheduling/BartoliniDI17OpenAlexW2607113817WikidataQ59222225 ScholiaQ59222225MaRDI QIDQ1707827

Enrico Bartolini, Mauro Dell'Amico, Manuel Iori

Publication date: 4 April 2018

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-017-0517-1

zbMATH Keywords

column generationset partitioningidle time minimizationscheduling trains

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds

Cites Work

• Unnamed Item
• Unnamed Item
• Workforce scheduling and routing problems: literature survey and computational study
• Strong LP formulations for scheduling splittable jobs on unrelated machines
• Parallel machine scheduling with splitting jobs
• Combined column-and-row-generation for the optimal communication spanning tree problem
• On multi-processor speed scaling with migration
• Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
• Decomposition Principle for Linear Programs
• Fifty years of scheduling: a survey of milestones
• Manpower allocation with time windows
• Approximations for minimum and min-max vehicle routing problems
• Scheduling Jobs on Several Machines with the Job Splitting Property
• Scheduling

This page was built for publication: Scheduling cleaning activities on trains by minimizing idle times