Using aggregation to reduce response time variability in cyclic fair sequences

DOI10.1007/S10951-009-0127-7zbMATH Open1208.90063OpenAlexW2059511296MaRDI QIDQ633539FDOQ633539

Authors: Jeffrey W. Herrmann 

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

Recommendations

• Optimality of the cyclic sequence on bottleneck product rate variation problem with a general objective
• Cyclic just-in-time sequences are optimal
• Response time variability
• The weighted fair sequences problem
• Proportional optimization and fairness

zbMATH Keywords

aggregationfair sequencesresponse time variability

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Aggregation and Disaggregation Techniques and Methodology in Optimization
• Minimizing Service and Operation Costs of Periodic Scheduling
• Vehicle minimization for periodic deliveries
• Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
• Response time variability
• Technical Note—Optimal Scheduling of Periodic Activities
• Level Schedules for Mixed-Model, Just-in-Time Processes
• Note—Sequencing JIT Mixed-Model Assembly Lines
• Title not available (Why is that?)
• Worst-case analysis of an approximation algorithm for flow-shop scheduling
• On a periodic maintenance problem

Cited In (4)

• 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

This page was built for publication: Using aggregation to reduce response time variability in cyclic fair sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633539)