Minimizing Service and Operation Costs of Periodic Scheduling

From MaRDI portal
Publication:5704095

DOI10.1287/moor.27.3.518.314zbMath1082.90523OpenAlexW2096318933MaRDI QIDQ5704095

Baruch Schieber, Amotz Bar-Noy, Joseph (Seffi) Naor, Randeep Bhatia

Publication date: 11 November 2005

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.27.3.518.314




Related Items (24)

Line search method for solving a non-preemptive strictly periodic scheduling problemPerfect periodic scheduling for binary tree routing in wireless networksScheduling policies for multi-period servicesThe weighted fair sequences problemResponse time variabilityPerfect periodic scheduling for three basic cyclesAn iterative exact algorithm for the weighted fair sequences problemDynamic Windows Scheduling with ReallocationA branch-and-price algorithm for the aperiodic multi-period service scheduling problemAn efficient implementation of a VNS heuristic for the weighted fair sequences problemSimple strategies versus optimal schedules in multi-agent patrollingUsing aggregation to reduce response time variability in cyclic fair sequencesA note on the integrality gap of an ILP formulation for the periodic maintenance problemWindows scheduling of arbitrary-length jobs on multiple machinesMultiplicity and complexity issues in contemporary production schedulingBalancing and clustering of words in the Burrows-Wheeler transformModeling and solving the periodic maintenance problemScheduling of transportation fleet maintenance service by an improved Lipschitz optimization algorithmScheduling to minimize energy and flow time in broadcast schedulingA dynamic Lipschitz algorithm for determining economic maintenance frequency of a transport fleetNew search algorithm for solving the maintenance scheduling problem for a family of machinesPeriodic scheduling with obligatory vacationsMathematical programming modeling of the response time variability problemA framework for the complexity of high-multiplicity scheduling problems




This page was built for publication: Minimizing Service and Operation Costs of Periodic Scheduling