Response time variability

Journal of Scheduling

Volumn 10, Issue 2, 2007, Pages 97-110

  Corominas, Albert ^a   Kubiak, Wieslaw ^b   Palli, Natalia Moreno ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

Author keywords

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

Indexed keywords

COMBINATORIAL OPTIMIZATION; ISOCHRONOUS APPLICATIONS; MIXED MODEL ASSEMBLY LINES; RESPONSE TIME VARIABILITY;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; JOB ANALYSIS; OPTIMIZATION; POLYNOMIALS;

RESPONSE TIME (COMPUTER SYSTEMS);

EID: 33847311436     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-006-0002-8     Document Type: Article

References (19)

1. Altman, E., B. Gaujal, and A. Hordijk, "Multimodularity, convexity and optimization properties," Mathematics of Operations Research, 25, 324-347 (2000).
2. Anily, S., C. A. Glass, and R. Hassin, "The scheduling of maintenance service," Discrete Applied Mathematics, 82, 27-42 (1998).
3. Balinski, M. L. and H. P. Young, Fair Representation. Yale University Press, New Haven, CT (1982).
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).
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).
6. Bautista, J., R. Companys, and A. Corominas, "Modelling and solving the production rate variation problem," TOP, 5(2), 221-239 (1997).
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).
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).
9. Feo, T. and M. Resende, "A probabilistic heuristic for a computationally difficult set covering problem," Operations Research Letters, 8, 6771 (1989).
10. Grigoriev, A., "High Multiplicity Scheduling Problems," Ph.D. Thesis, Maastricht University, Maastricht, Netherlands (2003).
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).
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).
13. Kubiak, W., "Minimizing variations of productions rates in just-in-time systems: A survey," European Journal of Operational Research, 66, 259-271 (1993).
14. Kubiak, W., "On small deviations conjecture," Bulletin of the Polish Academy of Sciences, 51, 189-203 (2003).
15. Kubiak, W. "Fair sequences," in: Joseph Y.-T. Leung (ed.), Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Chapman and Hall/CRC (2004).
16. Monden, Y., Toyota Production Systems. Industrial Engineering and Management Press, Norcross, GA (1983).
17. Moreno, N., "Solving the product rate variation problem (PRVP) of large dimensions as an assignment problem," Doctoral Thesis, DOE, UPC (2002).
18. Steiner, G. and S. Yeomans, "Level schedules for mixed-model, just-in-time processes," Management Science, 39(6), 728-735 (1993).
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).