A GRASP for Parallel Machine Scheduling with Time Windows

References

• Arkin E. M., Silverberg E. B. Scheduling jobs with fixed start and end times. Discrete Appl. Math. (1987) 18:1–8Crossref, Google Scholar
• Bouzina K. I., Emmons H. Interval scheduling on identical machines. J. Global Optim. (1996) 9:379–393Crossref, Google Scholar
• Brazile R. P., Swigger K. M. Generalized heuristics for the gate assignment problem. Control Comput. (1991) 19:27–32Google Scholar
• Butt S. E., Cavalier T. M. A heuristic for the multiple tour maximum collection problem. Comput. Oper. Res. (1994) 21:101–111Crossref, Google Scholar
• Cheng T. C. E., Sin C. C. S. A state-of-the-art review of parallel-machine scheduling research. Eur. J. Oper. Res. (1990) 47:271–292Crossref, Google Scholar
• Conover W. J.Practical Nonparametric Statistics (1980) (John Wiley & Sons, New York) Google Scholar
• Dodd J. C., Reddy S. D. The scheduling technology in the NASA TDRSS network control center (NCC). (1987) . AAS paper, Computer Sciences Corporation, Beltsville, MDGoogle Scholar
• Feo T. A., Resende M. G. C. Greedy randomized adaptive search procedures. J. Global Optim. (1995) 6:109–133Crossref, Google Scholar
• Gabrel V. Scheduling jobs within time windows on identical parallel machines: New model and algorithms. Eur. J. Oper. Res. (1995) 83:320–329Crossref, Google Scholar
• Gensch D. H. An industrial application of the traveling salesman's subtour problem. AIIE Trans. (1978) 10:362–370Crossref, Google Scholar
• Golden B. L., Levy L., Dahl R. Two generalizations of the traveling salesman problem. Omega (1981) 8:439–441Crossref, Google Scholar
• Golden B. L., Levy L., Vohra R. The orienteering problem. Naval Res. Logist. Quart. (1987) 34:307–318Crossref, Google Scholar
• Graham R. L., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math. (1979) 5:287–326Crossref, Google Scholar
• Kolen A. W., Kroon L. G. On the computational complexity of (maximum) shift class scheduling. Eur. J. Oper. Res. (1993) 64:138–151Crossref, Google Scholar
• Kontoravdis G., Bard J. F. A randomized adaptive search procedure for the vehicle routing problem with time windows. ORSA J. Comput. (1995) 7:10–23Link, Google Scholar
• Kroon L. G., Salomon M., Van Wassenhove L. N. Exact and approximation algorithms for the tactical fixed interval scheduling problem. Oper. Res. (1997) 45:624–638Link, Google Scholar
• Laporte G., Martello S. The selective traveling salesman problem. Discrete Appl. Math. (1990) 26:193–207Crossref, Google Scholar
• Lawler E. L., Martel C. U. Preemptive scheduling of two uniform machines to minimize the number of late jobs. Oper. Res. (1989) 37:314–318Link, Google Scholar
• Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Shmoys D. B., Graves S. S., Rinnooy Kan A. H. G., Zipkin P. Sequencing and scheduling: Algorithms and complexity. Handbook in Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory (1993) (North-Holland, New York) 445–522Google Scholar
• Martel C. U., Dempster M. A. H., Lenstra J. K., Rinnooy Kan A. H. G. Scheduling uniform machines with release times, deadlines and due times. Deterministic and Stochastic Scheduling (1982) (Reidel, Dordrecht, The Netherlands) 89–99Crossref, Google Scholar
• Or I. Traveling salesmen-type combinatorial problems and their relation to the logistics of blood banking. (1976) . Ph.D. thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, ILGoogle Scholar
• Pinedo M.Scheduling: Theory, Algorithms, and Systems (1995) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Reddy S. D., Brown W. L. Single processor scheduling with job priorities and arbitrary ready and due times. (1986) . Working paper, Computer Sciences Corporation, Beltsville, MDGoogle Scholar
• Rojanasoonthon S. Parallel machine scheduling with time windows. (2003) . Ph.D. thesis, Graduate Program in Operations Research and Industrial Engineering, University of Texas, Austin, TXGoogle Scholar
• Rojanasoonthon S., Bard J. F., Reddy S. D. Algorithms for scheduling of the tracking and data relay satellite system. J. Oper. Res. Soc. (2003) 54:806–821Crossref, Google Scholar
• Savelsbergh M. W. P. Local search in routing problems with time windows. Ann. Oper. Res. (1985) 4:285–305Crossref, Google Scholar
• Savelsbergh M. W. P. The vehicle routing problem with time windows: Minimizing route duration. ORSA J. Comput. (1992) 4:146–154Link, Google Scholar