|
Yunpeng Pan |
|
|
About Me |
|
|
I am a UW graduate (MS:CS:01 and PhD:IE:03). Currently, I teach at South Dakota State University.
|
|
|
|
|
|
Journal Papers |
|
|
|
1. L. Pi, Y. Pan, and L. Shi 2008. Hybrid nested partitions and mathematical programming approach and its applications. IEEE Transactions on Automation Science and Engineering Vol. 5 n. 4 pp. 573-586 2. Y. Pan and L. Shi 2007. On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems. Mathematical Programming, Series A. Vol. 110 n. 3 pp. 543-559 3. Y. Pan and L. Shi 2008. New hybrid optimization algorithms for machine scheduling problems. IEEE Transactions on Automation Science and Engineering Vol. 5 n. 2 pp. 337-348 4. H. Yau, Y. Pan, and L. Shi 2008. New solution approaches to the general single machine earliness-tardiness problem. IEEE Transactions on Automation Science and Engineering Vol. 5 n. 2 pp. 349-360 5. Y. Pan and L. Shi 2006. Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem. European Journal of Operational Research Vol. 168 n. 3 pp. 1030-1039 6. Y. Pan and L. Shi 2005. Dual constrained single machine sequencing to minimize total weighted completion time. IEEE Transactions on Automation Science and Engineering Vol. 2 n. 4 pp. 344-357 7. L. Shi and Y. Pan 2005. An efficient search method for job-shop scheduling problems. IEEE Transactions on Automation Science and Engineering Vol. 2 n. 1 pp. 73-77 8. Y. Pan 2003. An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. Operations Research Letters Vol. 31 n. 6 pp. 492-496 9. L. Shi and Y. Pan 2003. Minimizing job shop inventory with on-time delivery guarantees. Journal of Systems Science and Systems Engineering Vol. 12 n. 4 pp. 449-469 |
|
Unpublished Manuscripts |
|
|
|
1. Y. Pan 2006. A combinatorial auctions perspective on min-sum scheduling problems. Available on Optimization Online (link). Note: Among the research articles that I have worked on, this one stands out as my personal favorite. 2. Y. Pan 2006. Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems. Available on Optimization Online (link). 3. Y. Pan and L. Shi 2006. Finding the best root node strategy for the approximation of the time-indexed bound in min-sum scheduling. Available on Optimization Online (link). |
|
Conference Papers/Posters |
|
|
|
1. L. Pi, Y. Pan, and L. Shi 2006. Nested Partitions Method for the Local Pickup and Delivery Problem. Proceedings of IEEE Conference on Automation Science and Engineering, October 8-10, Shanghai, China 2.
Y. Pan,
W. Lu, K. Ruchala, M. Chen, Q. Chen, P. Kupelian, K. Langen, 3. W. Lu, G. Olivera, Q. Chen, M. Chen, Y. Pan, E. Schnarr, K. Ruchala 2006. Motion encoded beamlets for optimization and evaluation in four-dimensional (4D) radiotherapy. Medical Physics Vol. 33 n. 6 p. 2042. General poster session, AAPM 48th Annual Meeting 4. M. Chen, W. Lu, K. Ruchala, Q. Chen, Y. Pan, G. Olivera 2006. A simple iterative method to invert a deformation field. Medical Physics Vol. 33 n. 6 p. 2185. AAPM 48th Annual Meeting 5. Y. Pan, L. Shi, L. Pi 2005. Solving the Two-Stage Homing Driver Problem with Applications in Truckload Trucking. Proceedings of 10th MSOM Conference 6.
Y. Pan,
L. Shi, H. Yau 2005. A New Optimization Approach to the General Single
Machine Earliness-Tardiness Problem. Proceedings of IEEE Conference on
Automation Science and Engineering, August 1-2, 7. Y. Pan and L. Shi 2004. A stochastic on-line model for shipment date quoting with on-time delivery guarantees. Proceedings of the 2004 Winter Simulation Conference, Vol. 2, pp. 1195-1199, Ingalls, R.G., Rossetti, M.D., and Peters, B.A. (eds.) 8. Y. Pan and L. Shi 2004. On the optimal solution of the general min-max sequencing problem. Proceedings of the IEEE Conference on Decision and Control, Vol. 3, pp. 3189-3190
|
|
Invited Talk |
|
|
1. A Combinatorial Auctions Perspective on Min-Sum Scheduling Problems. Invited talk for ISyE Department Colloquium Series at University of Wisconsin-Madison (link) |
|
|
Benchmark |
|
|
|
1. Minimizing total weighted completion time on a single machine subject to release dates (n=20,...,200) (link) 2. Francis Sourd's earliness-tardiness instances (link) |