Michael Pinedo | New York University (original) (raw)
Michael Pinedo is the Julius Schlesinger Professor of Operations Management in the Department of Information, Operations and Management Sciences at New York University's Leonard N. Stern School of Business.
Professor Pinedo's research focuses on the modeling of production and service systems, and, more specifically, on the planning and scheduling of these systems. Recently, his research also has focused on operational risk in financial services. He has both written and co-written a number of technical papers on these topics. He is the author of the books, Scheduling: Theory, Algorithms and Systems (Springer), and, Planning and Scheduling in Manufacturing and Services (Springer), and the coauthor of, Queueing Networks: Customers, Signals and Product Form Solutions (Wiley). He is co-editor of, Creating Value in Financial Services: Strategies, Operations, and Technologies (Kluwer), and editor of, Operational Control in Asset Management - Processes and Costs (Palgrave/McMillan). Over the last three decades Professor Pinedo has been involved in industrial systems development. He supervised the design, development and implementation of two planning and scheduling systems for the International Paper Company. He also actively participated in the development of systems at Goldman Sachs, Philips Electronics, Siemens, and at Merck. Professor Pinedo is currently editor of the Journal of Scheduling (Wiley). He is associate editor of Naval Research Logistics, department editor of Production and Operations Management, and Associate Editor of Annals of Operations Research. Professor Pinedo received an Ir. degree in Mechanical Engineering from the Delft University of Technology, the Netherlands in 1973 and a M.Sc. and a Ph.D. in Operations Research from the University of California at Berkeley in 1978.
less
Uploads
Papers by Michael Pinedo
Springer eBooks, Jul 1, 2008
Bookmarks Related papers MentionsView impact
Springer eBooks, 2016
Bookmarks Related papers MentionsView impact
Annals of Operations Research, Sep 4, 2015
The practice of emergency operations often involves the travelling of medical teams and the distr... more The practice of emergency operations often involves the travelling of medical teams and the distribution of medical supplies. In an emergency, such as an earthquake, a medical team often has to visit various hospitals (the customers) one after another in a predetermined sequence in order to perform on-site operations that require certain amounts of medical supplies. Because of their perishable nature, the medical supplies are typically shipped in batches from upstream suppliers and kept at multiple distribution centers during the disaster relief process. The scheduling of the medical teams and the provisioning of the medical supplies give rise to a scheduling problem that involves the timely dispatching of supplies from distribution centers to hospitals in coordination with the scheduling of medical teams so as to minimize the total tardiness of the completions of the operations to be performed. We introduce a mathematical programming based rolling horizon heuristic that is able to find near optimal solutions for networks of up to 80 hospitals very fast. We also report on empirical observations with regard to the computational performance of the heuristic; we consider 5420 randomly generated test cases as well as a case that is based on an actual hospital-distribution center network in the greater New York metropolitan area. Managerial insights are drawn from numerical studies regarding the benefits of pre-positioning medical supplies at the distribution centers.
Bookmarks Related papers MentionsView impact
Springer eBooks, 2022
Bookmarks Related papers MentionsView impact
Springer eBooks, 2022
Bookmarks Related papers MentionsView impact
Journal of Scheduling, Feb 1, 2020
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Traditional scheduling research focuses on problems with a single objective. However, in practice... more Traditional scheduling research focuses on problems with a single objective. However, in practice a schedule is often judged by more than one criterion. For instance, the interests of customers are usually not taken into account in low-cost production strategies. Managers often have to juggle schedules in order to satisfy customers without increasing cost. For this reason, problems with multiple objectives are becoming popular in scheduling research. In the thesis, we consider two single-machine scheduling problems with dual objective functions. The first problem is a classical double-objective problem. The objectives considered are maximum tardiness and the number of late jobs. We present a branch-and-bound algorithm for the problem with fixed maximum tardiness. We also suggest extensions of this algorithm in order to compute the complete trade-off curve of the two objectives. The second problem belongs to another relatively new direction in scheduling research, namely, scheduling with controllable processing times. Here, processing times of jobs are not fixed and can be compressed. We assume that this compression incurs a linear cost, which is included in the objective. The main objective is the number of late jobs. We prove that this problem is NP-hard, present a pseudo-polynomial dynamic programming algorithm, and also consider three special cases which are solvable in polynomial time. We also discuss applications of scheduling theory. We present a classification of scheduling systems, discuss the requirements for each class, and present examples. Special attention is paid to a module for designing custom algorithms. Such a module can be very useful in an educational scheduling system; however, it is not present in most existing systems. Last, we present an educational scheduling system called LEKIN. We designed LEKIN for teaching Scheduling and Operation Management courses. The system can be also used as a tool for algorithm design.
Bookmarks Related papers MentionsView impact
A bank of machines in parallel is a setting that is important from both a theoretical and a pract... more A bank of machines in parallel is a setting that is important from both a theoretical and a practical point of view. From a theoretical point of view it is a generalization of the single machine, and a special case of the flexible flow shop. From a practical point of view, it is important because the occurrence of resources in parallel is common in the real world. Also, techniques for machines in parallel are often used in decomposition procedures for multi-stage systems.
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Production and Operations Management, Sep 1, 2009
Bookmarks Related papers MentionsView impact
Springer eBooks, 2016
Bookmarks Related papers MentionsView impact
Springer eBooks, Jul 1, 2008
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Springer eBooks, Jul 1, 2008
Bookmarks Related papers MentionsView impact
Journal of the Operational Research Society, Apr 5, 2023
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Journal of Scheduling, Feb 1, 2016
Bookmarks Related papers MentionsView impact
Routledge eBooks, Mar 27, 2017
Bookmarks Related papers MentionsView impact
Springer eBooks, Jul 1, 2008
Bookmarks Related papers MentionsView impact
Springer eBooks, 2016
Bookmarks Related papers MentionsView impact
Annals of Operations Research, Sep 4, 2015
The practice of emergency operations often involves the travelling of medical teams and the distr... more The practice of emergency operations often involves the travelling of medical teams and the distribution of medical supplies. In an emergency, such as an earthquake, a medical team often has to visit various hospitals (the customers) one after another in a predetermined sequence in order to perform on-site operations that require certain amounts of medical supplies. Because of their perishable nature, the medical supplies are typically shipped in batches from upstream suppliers and kept at multiple distribution centers during the disaster relief process. The scheduling of the medical teams and the provisioning of the medical supplies give rise to a scheduling problem that involves the timely dispatching of supplies from distribution centers to hospitals in coordination with the scheduling of medical teams so as to minimize the total tardiness of the completions of the operations to be performed. We introduce a mathematical programming based rolling horizon heuristic that is able to find near optimal solutions for networks of up to 80 hospitals very fast. We also report on empirical observations with regard to the computational performance of the heuristic; we consider 5420 randomly generated test cases as well as a case that is based on an actual hospital-distribution center network in the greater New York metropolitan area. Managerial insights are drawn from numerical studies regarding the benefits of pre-positioning medical supplies at the distribution centers.
Bookmarks Related papers MentionsView impact
Springer eBooks, 2022
Bookmarks Related papers MentionsView impact
Springer eBooks, 2022
Bookmarks Related papers MentionsView impact
Journal of Scheduling, Feb 1, 2020
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Traditional scheduling research focuses on problems with a single objective. However, in practice... more Traditional scheduling research focuses on problems with a single objective. However, in practice a schedule is often judged by more than one criterion. For instance, the interests of customers are usually not taken into account in low-cost production strategies. Managers often have to juggle schedules in order to satisfy customers without increasing cost. For this reason, problems with multiple objectives are becoming popular in scheduling research. In the thesis, we consider two single-machine scheduling problems with dual objective functions. The first problem is a classical double-objective problem. The objectives considered are maximum tardiness and the number of late jobs. We present a branch-and-bound algorithm for the problem with fixed maximum tardiness. We also suggest extensions of this algorithm in order to compute the complete trade-off curve of the two objectives. The second problem belongs to another relatively new direction in scheduling research, namely, scheduling with controllable processing times. Here, processing times of jobs are not fixed and can be compressed. We assume that this compression incurs a linear cost, which is included in the objective. The main objective is the number of late jobs. We prove that this problem is NP-hard, present a pseudo-polynomial dynamic programming algorithm, and also consider three special cases which are solvable in polynomial time. We also discuss applications of scheduling theory. We present a classification of scheduling systems, discuss the requirements for each class, and present examples. Special attention is paid to a module for designing custom algorithms. Such a module can be very useful in an educational scheduling system; however, it is not present in most existing systems. Last, we present an educational scheduling system called LEKIN. We designed LEKIN for teaching Scheduling and Operation Management courses. The system can be also used as a tool for algorithm design.
Bookmarks Related papers MentionsView impact
A bank of machines in parallel is a setting that is important from both a theoretical and a pract... more A bank of machines in parallel is a setting that is important from both a theoretical and a practical point of view. From a theoretical point of view it is a generalization of the single machine, and a special case of the flexible flow shop. From a practical point of view, it is important because the occurrence of resources in parallel is common in the real world. Also, techniques for machines in parallel are often used in decomposition procedures for multi-stage systems.
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Production and Operations Management, Sep 1, 2009
Bookmarks Related papers MentionsView impact
Springer eBooks, 2016
Bookmarks Related papers MentionsView impact
Springer eBooks, Jul 1, 2008
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Springer eBooks, Jul 1, 2008
Bookmarks Related papers MentionsView impact
Journal of the Operational Research Society, Apr 5, 2023
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Journal of Scheduling, Feb 1, 2016
Bookmarks Related papers MentionsView impact
Routledge eBooks, Mar 27, 2017
Bookmarks Related papers MentionsView impact