Advertisement

Journal of Scheduling

, Volume 10, Issue 2, pp 97–110 | Cite as

Response time variability

  • Albert Corominas
  • Wieslaw Kubiak
  • Natalia Moreno Palli
Article

Abstract

Response time variability is a new optimization problem with a broad range of applications and a distinctive number of theoretic flavour. The problem occurs whenever events, jobs, clients or products need to be sequenced so as to minimize the variability of time for which they wait for the next turn in obtaining the resources necessary for their advance. The problem has numerous real-life applications. We study its computational complexity, present efficiency, polynomial time algorithms for some cases, and the NP-hardness proof for a general problem. We propose a position exchange heuristic and apply it to improve the total response time variability of an initial sequence. The latter is the optimum bottleneck sequence, Webster or Jefferson sequence of the apportionment, or a random sequence. We report on computational experiments with the heuristic.

Keywords

Response time variability Isochronous applications Mixed-model assembly lines Combinatorial optimisation Heuristics 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Altman, E., B. Gaujal, and A. Hordijk, “Multimodularity, convexity and optimization properties,” Mathematics of Operations Research, 25, 324–347 (2000).CrossRefGoogle Scholar
  2. Anily, S., C. A. Glass, and R. Hassin, “The scheduling of maintenance service,” Discrete Applied Mathematics, 82, 27–42 (1998).CrossRefGoogle Scholar
  3. Balinski, M. L. and H. P. Young, Fair Representation. Yale University Press, New Haven, CT (1982).Google Scholar
  4. Bar-Noy, A., R. Bhatia, J. Naor, and B. Schieber, “Minimizing service and operation costs of periodic scheduling,” Mathematics of Operations Research, 27, 518–544 (2002).CrossRefGoogle Scholar
  5. Bautista, J., R. Companys, and A. Corominas, “A note on the relation between the product rate variation (PRV) and the apportionment problem,” Journal of Operational Research Society, 47, 1410–1414 (1996).CrossRefGoogle Scholar
  6. Bautista, J., R. Companys, and A. Corominas, “Modelling and solving the production rate variation problem,” TOP, 5(2), 221–239 (1997).Google Scholar
  7. Brauner, N., Y. Crama, A. Grigoriev, and J. Van de Klundert, “On the complexity of high-multiplicity scheduling problems,” Journal of Combinatorial Optimization, 9(3), 313–323 (2005).CrossRefGoogle Scholar
  8. Dong, L., R. Melhem, and D. Mosse, “Time slot allocation for real-time messages with negotiable distance constrains requirements,” in: Proceedings of The Real-Time Technology and Application Symposium, RTAS, Denver, CO (1998).Google Scholar
  9. Feo, T. and M. Resende, “A probabilistic heuristic for a computationally difficult set covering problem,” Operations Research Letters, 8, 6771 (1989).CrossRefGoogle Scholar
  10. Grigoriev, A., “High Multiplicity Scheduling Problems,” Ph.D. Thesis, Maastricht University, Maastricht, Netherlands (2003).Google Scholar
  11. Han, C. C., K. J. Lin, and C. J. Hou, “Distance-constrained scheduling and its applications in real-time systems,” IEEE Transactions on Computers, 45(7), 814–826 (1996).CrossRefGoogle Scholar
  12. Kubiak, W. and S. P. Sethi, “A note on level schedules for mixed-model assembly lines in just-in-time production systems,” Management Science, 37, 121–122 (1991).CrossRefGoogle Scholar
  13. Kubiak, W., “Minimizing variations of productions rates in just-in-time systems: A survey,” European Journal of Operational Research, 66, 259–271 (1993).CrossRefGoogle Scholar
  14. Kubiak, W., “On small deviations conjecture,” Bulletin of the Polish Academy of Sciences, 51, 189–203 (2003).Google Scholar
  15. Kubiak, W. “Fair sequences,” in: Joseph Y.-T. Leung (ed.), Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Chapman and Hall/CRC (2004).Google Scholar
  16. Monden, Y., Toyota Production Systems. Industrial Engineering and Management Press, Norcross, GA (1983).Google Scholar
  17. Moreno, N., “Solving the product rate variation problem (PRVP) of large dimensions as an assignment problem,” Doctoral Thesis, DOE, UPC (2002).Google Scholar
  18. Steiner, G. and S. Yeomans, “Level schedules for mixed-model, just-in-time processes,” Management Science, 39(6), 728–735 (1993).Google Scholar
  19. Waldspurger, C. A. and W. E. Weihl, Stride scheduling: Deterministic proportional-share resource management. Technical Memorandum MIT/LCS/TM-528 MIT Laboratory for Computer Science Cambridge, MA 02139 (1995).Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Albert Corominas
    • 1
  • Wieslaw Kubiak
    • 2
  • Natalia Moreno Palli
    • 2
  1. 1.Institute of Industrial and Control EngineeringUniversitat Politècnica de CatalunyaBarcelonaSpain
  2. 2.Faculty of Business Administration, Memorial University of NewfoundlandSt. John’sCanada

Personalised recommendations