Online Scheduling with Lookahead: Multipass Assembly Lines

Published Online:https://doi.org/10.1287/ijoc.10.3.331

References

  • Albers S. The Influence of Lookahead in Competitive On-Line Algorithms. (1993) . Technical report MPI-I-92-143. Max Planck Institute, Germany Google Scholar
  • Awerbuch B. , Bartal Y. , Fiat A. Competitive Distributed File Allocation. Proceedings of ACM Symposium on Theory of Computing (1993) 164 173 CrossrefGoogle Scholar
  • Borodin A. , Irani S. , Raghavan P. , Schieber B. Competitive Paging with Locality of Reference. Proceedings of ACM Symposium on Theory of Computing (1991) 249 259 CrossrefGoogle Scholar
  • Ermer D. , Kromodihardjo S. Optimization of Multipass Turning with Constraints. Transactions of the ASME (1981) 103 462 468 Google Scholar
  • Fiat A. , Karp R. , Luby M. , Mcgeoch L. , Sleator D. , Young N. Competitive Paging Algorithms. Journal of Algorithms (1991) 12 685 699 CrossrefGoogle Scholar
  • Fiat A. , Rosen Z. Experimental Studies of Access Graph Based Heuristics: Beating the Lru Standard? Proceedings ACM-SIAM Symposium on Discrete Algorithms (1997) 63 72 Google Scholar
  • Gascon A. The Lookahead Heuristic for Multi-item Single Machine Production Scheduling with Dynamic, Stochastic Demands. INFOR (1988) 26 114 126 Google Scholar
  • Graham R. Bounds for Certain Multiprocessing Anomalies. Bell System Technical Journal (1966) 45 1563 1581 CrossrefGoogle Scholar
  • Irani S. , Karlin A. , Phillips S. Strongly Competitive Algorithms for Paging with Locality of Reference. Proceedings of ACM-SIAM Symposium on Discrete Algorithms (1992) 228 236 Google Scholar
  • Karlin A. , Phillips S. , Raghavan P. Markov Paging. Proceedings of IEEE Symposium on Foundations of Computer Science (1992) 208 217 CrossrefGoogle Scholar
  • Khanna S. , Motwani R. , Wilson R. On Certificates and Lookahead in Dynamic Graph Problems. Proceedings of ACM-SIAM Symposium on Discrete Algorithms (1996) 222 231 Google Scholar
  • Motwani R. , Phillips S. , Torng E. Non-Clairvoyant Scheduling. Theoretical Computer Science (1994) 130 1 17 47 CrossrefGoogle Scholar
  • Redford A. , Lo E. Robots in Assembly (1986) (Halsted Press, New York) Google Scholar
  • Sleator D. , Tarjan R. Amortized Efficiency of List Update and Paging Rules. CACM (1985) 28 202 208 CrossrefGoogle Scholar
  • Sriskandarajah C. , Sethi S. , Ladet P. Scheduling Methods for a Class of Flexible Manufacturing Systems. Annals of Operations Research (1989) 17 139 162 CrossrefGoogle Scholar
  • Yao A.-C. Probabilistic Computations: Towards a Unified Measure of Complexity. Proceedings of Symposium on Foundations of Computer Science (1977) 222 227 CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.