Yunpeng Pan 

About Me 

I graduated from UWMadison in 2001 (MS Comp Sci) and in 2003 (PhD Industrial Engr.). I now run the operations at ZMI USA Corp. in Silicon Valley. 



Journal Papers 


1. Y. Pan and Z. Liang 2017. Dual Relaxations of the TimeIndexed ILP Formulation for MinSum Scheduling Problems. Annals of Operations Research Vol. 249 n. 1 pp. 197213 2. 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. 573586 3. Y. Pan and L. Shi 2007. On the equivalence of the maxmin transportation lower bound and the timeindexed lower bound for singlemachine scheduling problems. Mathematical Programming, Series A. Vol. 110 n. 3 pp. 543559 4. 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. 337348 5. H. Yau, Y. Pan, and L. Shi 2008. New solution approaches to the general single machine earlinesstardiness problem. IEEE Transactions on Automation Science and Engineering Vol. 5 n. 2 pp. 349360 6. Y. Pan and L. Shi 2006. Branchandbound algorithms for solving hard instances of the onemachine sequencing problem. European Journal of Operational Research Vol. 168 n. 3 pp. 10301039 7. 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. 344357 8. L. Shi and Y. Pan 2005. An efficient search method for jobshop scheduling problems. IEEE Transactions on Automation Science and Engineering Vol. 2 n. 1 pp. 7377 9. 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. 492496 10. L. Shi and Y. Pan 2003. Minimizing job shop inventory with ontime delivery guarantees. Journal of Systems Science and Systems Engineering Vol. 12 n. 4 pp. 449469 
Conference Papers/Posters 


1. Y. Pan 2013. A combinatorial auctions perspective on minsum scheduling problems. Proceedings of the 9th Annual IEEE Conference on Automation Science and Engineering, pp. 564569. August 1720, Madison, Wisconsin 2. 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 810, Shanghai, China
3.
Y. Pan,
W. Lu, K. Ruchala, M. Chen, Q. Chen, P. Kupelian, K. Langen, 4. W. Lu, G. Olivera, Q. Chen, M. Chen, Y. Pan, E. Schnarr, K. Ruchala 2006. Motion encoded beamlets for optimization and evaluation in fourdimensional (4D) radiotherapy. Medical Physics Vol. 33 n. 6 p. 2042. General poster session, AAPM 48^{th} Annual Meeting 5. 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 48^{th} Annual Meeting 6. Y. Pan, L. Shi, L. Pi 2005. Solving the TwoStage Homing Driver Problem with Applications in Truckload Trucking. Proceedings of 10^{th} MSOM Conference
7.
Y. Pan,
L. Shi, H. Yau 2005. A New Optimization Approach to the General Single
Machine EarlinessTardiness Problem. Proceedings of IEEE Conference on
Automation Science and Engineering, August 12, 8. Y. Pan and L. Shi 2004. A stochastic online model for shipment date quoting with ontime delivery guarantees. Proceedings of the 2004 Winter Simulation Conference, Vol. 2, pp. 11951199, Ingalls, R.G., Rossetti, M.D., and Peters, B.A. (eds.) 9. Y. Pan and L. Shi 2004. On the optimal solution of the general minmax sequencing problem. Proceedings of the IEEE Conference on Decision and Control, Vol. 3, pp. 31893190

Presentations 

1. A Valuation Framework Using Real Options and Big Data for Selecting Cloud Data Center Sites. INFORMS 2014, San Francisco, CA 2. A Combinatorial Auctions Perspective on MinSum Scheduling Problems. Invited talk for ISyE Department Colloquium Series at University of WisconsinMadison (link) 

Benchmark 


1. Minimizing total weighted completion time on a single machine subject to release dates (n=20,...,200) (link) 2. Francis Sourd's earlinesstardiness instances (link)
