Dynamic multipriority patient scheduling for a diagnostic resource J Patrick, ML Puterman, M Queyranne Operations research 56 (6), 1507-1525, 2008 | 496 | 2008 |
An exact algorithm for maximum entropy sampling CW Ko, J Lee, M Queyranne Operations Research 43 (4), 684-691, 1995 | 432 | 1995 |
The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling JC Picard, M Queyranne Operations research 26 (1), 86-110, 1978 | 431 | 1978 |
Structure of a simple scheduling polyhedron M Queyranne Mathematical Programming 58 (1), 263-285, 1993 | 280 | 1993 |
Approximation schemes for minimizing average weighted completion time with release dates F Afrati, E Bampis, C Chekuri, D Karger, C Kenyon, S Khanna, I Milis, ... 40th annual symposium on foundations of computer science (Cat. No. 99CB37039 …, 1999 | 257 | 1999 |
Polyhedral approaches to machine scheduling M Queyranne, AS Schulz TU, Fachbereich 3, 1994 | 250 | 1994 |
Minimizing symmetric submodular functions M Queyranne Mathematical programming 82, 3-12, 1998 | 235 | 1998 |
On the structure of all minimum cuts in a network and applications JC Picard, M Queyranne Combinatorial Optimization II, 8-16, 1980 | 229 | 1980 |
Toward robust revenue management: Competitive analysis of online booking MO Ball, M Queyranne Operations Research 57 (4), 950-963, 2009 | 201 | 2009 |
Appointment scheduling with discrete random durations MA Begen, M Queyranne Mathematics of Operations Research 36 (2), 240-257, 2011 | 197 | 2011 |
Single machine scheduling with release dates MX Goemans, M Queyranne, AS Schulz, M Skutella, Y Wang SIAM Journal on Discrete Mathematics 15 (2), 165-192, 2002 | 197 | 2002 |
On the one-dimensional space allocation problem JC Picard, M Queyranne Operations Research 29 (2), 371-391, 1981 | 178 | 1981 |
Traveling salesman problem as a constrained shortest path problem: Theory and computational experience DJ Houck Jr, JC Picard, M Queyranne, RR Vemuganti Ecole polytechnique de Montréal, 1978 | 132 | 1978 |
Selected applications of minimum cuts in networks JC Picard, M Queyranne INFOR: Information Systems and Operational Research 20 (4), 394-422, 1982 | 131 | 1982 |
A network flow solution to some nonlinear 0‐1 programming problems, with applications to graph theory JC Picard, M Queyranne Networks 12 (2), 141-159, 1982 | 131 | 1982 |
On dynamic programming methods for assembly line balancing EPC Kao, M Queyranne Operations Research 30 (2), 375-390, 1982 | 127 | 1982 |
On the two-level uncapacitated facility location problem K Aardal, M Labbé, J Leung, M Queyranne INFORMS Journal on Computing 8 (3), 289-301, 1996 | 108 | 1996 |
Budgeting costs of nursing in a hospital EPC Kao, M Queyranne Management Science 31 (5), 608-621, 1985 | 102 | 1985 |
Minimizing the sum of weighted completion times in a concurrent open shop M Mastrolilli, M Queyranne, AS Schulz, O Svensson, NA Uhan Operations Research Letters 38 (5), 390-395, 2010 | 99 | 2010 |
Batch processing with interval graph compatibilities between tasks G Finke, V Jost, M Queyranne, A Sebő Discrete Applied Mathematics 156 (5), 556-568, 2008 | 97 | 2008 |