• You are viewing archived content on our old website. To see events added from March 2014 onwards, please view our new events pages.

Convex Relaxation Approach to Appointment Scheduling

Bookmark and Share

Thursday 1 December 2011, 16:00
LT4, Management School

Professor Guohua Wan
Shanghai Jiao Tong University

Abstract:This talk is concerned with the problem of scheduling a set of jobs with predetermined order on a single processor to minimize the total cost incurred by jobs waiting and processor idling, where job processing times are discrete random variables, and the cost functions are convex functions of job waiting times or processor idling times.  

For piece-wise linear objective functions, we prove optimality of integer solutions and develop a convex relaxation approach to solve the problem. Our study extends the results of Begen and Queyranne (2010) and Begen, Levi and Queyranne (2010), provides a new approach to investigate the appointment scheduling problem in general case, and simplifies the main proofs significantly.

Bio: Guohua Wan joined Shanghai Jiao Tong University in August 2007, where he is currently a professor of Management Science and associate dean of School of Management. He received his Ph.D. degree from Hong Kong University of Science and Technology and was a visiting scholar in Stern School of Business, New York University from January 2006 to March 2007.

His research interests include operations planning and scheduling, supply chain management, and management of information technology. He has published around 40 papers on these topics in such journals as Operations Research, INFORMS Journal on Computing, Naval Research Logistics, and European Journal of Operational Research. He currently serves as a Senior Editor of "Production and Operations Management".

Management Science News

A triple-accredited business school Association of MBAs | AACSB | EQUIS