Using aggregation to reduce response time variability in cyclic fair sequences
From MaRDI portal
Publication:633539
DOI10.1007/s10951-009-0127-7zbMath1208.90063MaRDI QIDQ633539
Publication date: 1 April 2011
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1903/8382
90B35: Deterministic scheduling theory in operations research
Related Items
Scheduling policies for multi-period services, Minimising maximum response time, A branch-and-price algorithm for the aperiodic multi-period service scheduling problem, A branch and bound algorithm for the response time variability problem
Cites Work
- Unnamed Item
- Response time variability
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
- Vehicle minimization for periodic deliveries
- On a periodic maintenance problem
- Note—Sequencing JIT Mixed-Model Assembly Lines
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- Technical Note—Optimal Scheduling of Periodic Activities
- Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
- Level Schedules for Mixed-Model, Just-in-Time Processes
- Minimizing Service and Operation Costs of Periodic Scheduling