Online Scheduling with Lookahead: Multipass Assembly Lines
Published Online:1 Aug 1998https://doi.org/10.1287/ijoc.10.3.331
References
- The Influence of Lookahead in Competitive On-Line Algorithms. (1993) . Technical report MPI-I-92-143. Max Planck Institute, Germany Google Scholar
- Competitive Distributed File Allocation. Proceedings of ACM Symposium on Theory of Computing (1993) 164 173 Crossref, Google Scholar
- Competitive Paging with Locality of Reference. Proceedings of ACM Symposium on Theory of Computing (1991) 249 259 Crossref, Google Scholar
- Optimization of Multipass Turning with Constraints. Transactions of the ASME (1981) 103 462 468 Google Scholar
- Competitive Paging Algorithms. Journal of Algorithms (1991) 12 685 699 Crossref, Google Scholar
- Experimental Studies of Access Graph Based Heuristics: Beating the Lru Standard? Proceedings ACM-SIAM Symposium on Discrete Algorithms (1997) 63 72 Google Scholar
- The Lookahead Heuristic for Multi-item Single Machine Production Scheduling with Dynamic, Stochastic Demands. INFOR (1988) 26 114 126 Google Scholar
- Bounds for Certain Multiprocessing Anomalies. Bell System Technical Journal (1966) 45 1563 1581 Crossref, Google Scholar
- Strongly Competitive Algorithms for Paging with Locality of Reference. Proceedings of ACM-SIAM Symposium on Discrete Algorithms (1992) 228 236 Google Scholar
- Markov Paging. Proceedings of IEEE Symposium on Foundations of Computer Science (1992) 208 217 Crossref, Google Scholar
- On Certificates and Lookahead in Dynamic Graph Problems. Proceedings of ACM-SIAM Symposium on Discrete Algorithms (1996) 222 231 Google Scholar
- Non-Clairvoyant Scheduling. Theoretical Computer Science (1994) 130 1 17 47 Crossref, Google Scholar
- Robots in Assembly (1986) (Halsted Press, New York) Google Scholar
- Amortized Efficiency of List Update and Paging Rules. CACM (1985) 28 202 208 Crossref, Google Scholar
- Scheduling Methods for a Class of Flexible Manufacturing Systems. Annals of Operations Research (1989) 17 139 162 Crossref, Google Scholar
- Probabilistic Computations: Towards a Unified Measure of Complexity. Proceedings of Symposium on Foundations of Computer Science (1977) 222 227 Crossref, Google Scholar

