A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities

Naval Research Logistics

Volumn 53, Issue 1, 2006, Pages 24-44

  Bard, Jonathan F ^a   Rojanasoonthon, Siwate ^b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b TMB Asset Management Co Ltd   (Thailand)

Author keywords

Branch and price; GRASP; Job priorities; Parallel machine scheduling; Time windows

Indexed keywords

BRANCH AND PRICE; GRASP; JOB PRIORITIES; PARALLEL MACHINE SCHEDULING; TIME WINDOWS;

ALGORITHMS; COMPUTATION THEORY; HEURISTIC METHODS; JOB ANALYSIS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

SCHEDULING;

EID: 33645679210     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.20118     Document Type: Article

References (24)

1. E.M. Arkin and E.B. Silverberg, Scheduling jobs with fixed start and end times, Discrete Appl Math 18 (1987), 1-8.
2. E. Balas, The prize collecting traveling salesman problem, Networks 19 (1989), 621-636.
3. J.F. Bard, G. Kontoravdis, and G. Yu, A branch-and-cut procedure for the vehicle routing problem with time windows. Transport Sc 36 (2002), 250-269.
4. C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.H. Vance, Branch-and-price: column generation for solving huge integer programs, Oper Res 46 (1998), 316-329.
5. K.I. Bouzina and H. Emmons, Interval scheduling on identical machines, J Global Optimization 9 (1996), 379-393.
6. S.E. Butt and T.M. Cavalier, A heuristic for the multiple tour maximum collection problem, Comput Oper Res 21 (1994), 101-111.
7. M.A. Chan, A. Muriel, and D. Simchi-Levi, Parallel machine scheduling, linear programming and parameter list scheduling heuristics, Oper Res 46 (1998), 729-741.
8. M. Desrochers, J. Desrosiers, and M.M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Oper Res 40 (1992), 342-354.
9. M. Desrochers and F. Soumis, A generalized permanent labelling algorithm for the shortest path problem with time windows, INFOR 26 (1988), 191-212.
10. J. Desrosiers, Y. Dumas, M.M. Solomon, and F. Soumis, "Time constrained routing and scheduling," Handbook in operations research and management science: Network routing, Vol. 8, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Editors), North-Holland, New York, 1995, pp. 35-140.
11. M. Dror, Note on the complexity of the shortest path models for column generation in VRPTW, Oper Res 42 (1994), 977-978.
12. V. Gabrel, Scheduling jobs within time windows on identical parallel machines: New model and algorithms, Eur J Oper Res 83(1995), 320-329.
13. B.L. Golden, L. Levy, and R. Vohra, The orienteering problem, Naval Res Logist Q 34 (1987), 307-318.
14. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan, Optimization and approximation in Deterministic Sequencing and Scheduling: A survey, Ann Discrete Math 5 (1979), 287-326.
15. E. Horowitz, S. Sahni, and S. Anderson-Freed, Fundamentals of data structures in C, Computer Science Press, New York, 1993.
16. A.W. Kolen and L.G. Kroon, On the computational complexity of (maximum) shift class scheduling, Eur J Oper Res 64 (1993), 138-151.
17. G. Laporte and S. Martello, The selective traveling salesman problem, Discrete Appl Math 26 (1990), 193-207.
18. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, Handbook in operations research and management science: Logistics of production and inventory, Vol. 4, S.S. Graves, A.H.G. Rinnooy Kan, P. Zipkin (Editors), North-Holland, New York, 1993, pp. 445-522.
19. W.B. Powell and Z.-L. Chen, A generalized threshold algorithm for the shortest path problem with time windows, DIMACS Ser Discrete Math Theor Comput Sci 40 (1998), 303-318.
20. S. Rojanasoonthon, Parallel machine scheduling with time windows, Ph.D. dissertation, Graduate Program in Operations Research and Industrial Engineering, University of Texas, Austin, Texas, 2004.
21. S. Rojanasoonthon, J.F. Bard, and S.D. Reddy, Algorithms for scheduling of the tracking and data relay satellite system, J Oper Res Soc 54 (2003), 806-821.
22. L.A. Wolsey, Integer programming, Wiley, New York, 1998.
23. T.C.E. Cheng and C.C.S. Sin, A state-of-the-art review of parallel-machine scheduling research, Eur J Oper Res 47 (1990), 271-292.
24. J. Blazewicz, M. Dror and J. Weglarz, Mathematical programming formulations for machinery scheduling: A survey, Eur J Oper Res 51 (1991), 283-300.