Minimizing Service and Operation Costs of Periodic Scheduling
From MaRDI portal
Recommendations
Cited in
(39)- Periodic scheduling with obligatory vacations
- Mathematical programming modeling of the response time variability problem
- Pinwheel scheduling with two distinct numbers
- Scheduling maintenance services to three machines
- The scheduling of maintenance service
- The weighted fair sequences problem
- A branch-and-price algorithm for the aperiodic multi-period service scheduling problem
- Bamboo garden trimming problem: priority schedulings
- Scheduling to minimize energy and flow time in broadcast scheduling
- Simple strategies versus optimal schedules in multi-agent patrolling
- Priority scheduling in the bamboo garden trimming problem
- Windows scheduling of arbitrary-length jobs on multiple machines
- Modeling and solving the periodic maintenance problem
- A framework for the complexity of high-multiplicity scheduling problems
- An iterative exact algorithm for the weighted fair sequences problem
- Line search method for solving a non-preemptive strictly periodic scheduling problem
- Balancing perfectly periodic service schedules: an application from recycling and waste management
- Perfect periodic scheduling for binary tree routing in wireless networks
- Scheduling policies for multi-period services
- scientific article; zbMATH DE number 17808 (Why is no real title available?)
- Perfect periodic scheduling for three basic cycles
- scientific article; zbMATH DE number 1303536 (Why is no real title available?)
- scientific article; zbMATH DE number 1305447 (Why is no real title available?)
- A note on the integrality gap of an ILP formulation for the periodic maintenance problem
- Periodic Scheduling with Service Constraints
- Dynamic windows scheduling with reallocation
- Multiplicity and complexity issues in contemporary production scheduling
- Balancing and clustering of words in the Burrows-Wheeler transform
- A dynamic Lipschitz algorithm for determining economic maintenance frequency of a transport fleet
- New search algorithm for solving the maintenance scheduling problem for a family of machines
- Scheduling of transportation fleet maintenance service by an improved Lipschitz optimization algorithm
- An efficient implementation of a VNS heuristic for the weighted fair sequences problem
- Using aggregation to reduce response time variability in cyclic fair sequences
- Matheuristics for scheduling of maintenance service with linear operation cost and step function maintenance cost
- On the periodic service scheduling problem with non-uniform demands
- Contention resolution with message deadlines
- Hardness and fixed parameter tractability for pinwheel scheduling problems
- Hardness and fixed parameter tractability for pinwheel scheduling problems
- Response time variability
This page was built for publication: Minimizing Service and Operation Costs of Periodic Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704095)
