Pengfei Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Pengfei Zhang has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
Diwakar Gupta
1 shared publication- Douglas J. Morrice
McCombs School of Business, The University of Texas at Austin, Austin, TX, USA
1 shared publication - Jonathan F. Bard
The University of Texas
1 shared publication Karl M. Koenig
Medical Director of the Integrated Practice Unit for Musculoskeletal Care, Dell Medical School, The University of Texas, Austin, TX, USA
1 shared publication
Latest Publications
- 19 May 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 311 (3) , 1023-1039
Robust optimization with order statistic uncertainty set
- 19 May 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 311 (3) , 1023-1039
Robust optimization with order statistic uncertainty set
- 23 April 2019
- Published by Taylor & Francis in IISE Transactions
- Vol. 51 (10) , 1037-1060
Extended open shop scheduling with resource constraints: Appointment scheduling for integrated practice units
An Integrated Practice Unit (IPU) is a new approach to outpatient care in which a co-located multidisciplinary team of clinicians, technicians, and staff provide treatment in a single patient visit. This article presents a new integer programming model for an extended open shop problem with application to clinic appointment scheduling for IPUs. The advantages of the new model are discussed and several valid inequalities are introduced to tighten the linear programming relaxation. The objective of the problem is to minimize a combination of makespan and total job processing time, or in terms of an IPU, to minimize a combination of closing time and total patient waiting time. Feasible solutions are obtained with a two-step heuristic, which also provides a lower bound that is used to judge solution quality. Next, a two-stage stochastic optimization model is presented for a joint pain IPU. The expected value solution is used to generate two different patient arrival templates. Extensive computations are performed to evaluate the solutions obtained with these templates and several others found in the literature. Comparisons with the expected value solution and the wait-and-see solution are also included. For the templates derived from the expected value solution, the results show that the average gap between the feasible solution and lower bound provided by the two-step heuristic is 2% for 14 patients. They also show that either of the two templates derived from the expected value solution is a good candidate for assigning appointment times when either the clinic closing time or the patient waiting time is the more important consideration. Sensitivity analysis confirmed that the optimality gap and clinic statistics are stable for marginal changes in key resources.
- 23 April 2019
- Published by Taylor & Francis in IISE Transactions
- Vol. 51 (10) , 1037-1060
Extended open shop scheduling with resource constraints: Appointment scheduling for integrated practice units
An Integrated Practice Unit (IPU) is a new approach to outpatient care in which a co-located multidisciplinary team of clinicians, technicians, and staff provide treatment in a single patient visit. This article presents a new integer programming model for an extended open shop problem with application to clinic appointment scheduling for IPUs. The advantages of the new model are discussed and several valid inequalities are introduced to tighten the linear programming relaxation. The objective of the problem is to minimize a combination of makespan and total job processing time, or in terms of an IPU, to minimize a combination of closing time and total patient waiting time. Feasible solutions are obtained with a two-step heuristic, which also provides a lower bound that is used to judge solution quality. Next, a two-stage stochastic optimization model is presented for a joint pain IPU. The expected value solution is used to generate two different patient arrival templates. Extensive computations are performed to evaluate the solutions obtained with these templates and several others found in the literature. Comparisons with the expected value solution and the wait-and-see solution are also included. For the templates derived from the expected value solution, the results show that the average gap between the feasible solution and lower bound provided by the two-step heuristic is 2% for 14 patients. They also show that either of the two templates derived from the expected value solution is a good candidate for assigning appointment times when either the clinic closing time or the patient waiting time is the more important consideration. Sensitivity analysis confirmed that the optimality gap and clinic statistics are stable for marginal changes in key resources.