default search action
Michael L. Pinedo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j94]Christos Koulamas
, George J. Kyparisis
Erratum to "Competitive Two-Agent Scheduling and Its Applications". Oper. Res. 72(4): 1749-1750 (2024) - [j93]Kan Fang
Rescheduling for new orders on a single machine with rejection. J. Oper. Res. Soc. 75(2): 346-360 (2024) - [j92]Myungho Lee
A critical review of planning and scheduling in steel-making and continuous casting in the steel industry. J. Oper. Res. Soc. 75(8): 1421-1455 (2024) - [j91]Hongming Li
Distributional Robustness and Inequity Mitigation in Disaster Preparedness of Humanitarian Operations. Manuf. Serv. Oper. Manag. 26(1): 197-214 (2024) - [j90]Xiaojuan Jiang, Kangbok Lee
Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits. J. Sched. 27(1): 61-86 (2024) - [i3]Klaus Heeger, Danny Hermelin, Michael L. Pinedo, Dvir Shabtay:
Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard. CoRR abs/2404.02784 (2024) - 2023
- [j89]Xiaojuan Jiang, Kangbok Lee
Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time. Eur. J. Oper. Res. 305(2): 594-607 (2023) - [c1]Dongyun Kim
Iterated Greedy Constraint Programming for Scheduling Steelmaking Continuous Casting. CPAIOR 2023: 477-492 - 2022
- [j88]Richard Bryant
On the optimality of the earliest due date rule in stochastic scheduling and in queueing. Eur. J. Oper. Res. 298(1): 202-212 (2022) - [j87]Juntaek Hong, Kyungduk Moon, Kangbok Lee
An iterated greedy matheuristic for scheduling in steelmaking-continuous casting process. Int. J. Prod. Res. 60(2): 623-643 (2022) - [j86]Danny Hermelin, Dvir Shabtay
A general scheme for solving a large set of scheduling problems with rejection in FPT time. J. Sched. 25(2): 229-255 (2022) - [j85]Myungho Lee, Kangbok Lee
Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs. J. Sched. 25(6): 721-740 (2022) - 2021
- [j84]Danny Hermelin, Shlomo Karhi, Michael L. Pinedo, Dvir Shabtay
New algorithms for minimizing the weighted number of tardy jobs on a single machine. Ann. Oper. Res. 298(1): 271-287 (2021) - [j83]Xiaojuan Jiang, Kangbok Lee
Ideal schedules in parallel machine settings. Eur. J. Oper. Res. 290(2): 422-434 (2021) - [j82]Kan Fang
A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions. Eur. J. Oper. Res. 291(1): 128-146 (2021) - 2020
- [j81]Danny Hermelin, George Manoussakis, Michael L. Pinedo, Dvir Shabtay, Liron Yedidsion:
Parameterized Multi-Scenario Single-Machine Scheduling Problems. Algorithmica 82(9): 2644-2667 (2020) - [j80]Juntaek Hong
Scheduling equal length jobs with eligibility restrictions. Ann. Oper. Res. 285(1): 295-314 (2020) - [j79]Tae-Sun Yu
Flow shops with reentry: Reversibility properties and makespan optimal schedules. Eur. J. Oper. Res. 282(2): 478-490 (2020) - [j78]Yuqian Xu
Operational Risk Management: A Stochastic Control Framework with Preventive and Corrective Controls. Oper. Res. 68(6): 1804-1825 (2020) - [j77]Edmund K. Burke, Michael L. Pinedo:
Journal of scheduling (2020). J. Sched. 23(1): 1-2 (2020)
2010 – 2019
- 2019
- [j76]Kangbok Lee
Online scheduling of ordered flow shops. Eur. J. Oper. Res. 272(1): 50-60 (2019) - [j75]Danny Hermelin, Michael L. Pinedo, Dvir Shabtay, Nimrod Talmon:
On the parameterized tractability of single machine scheduling with rejection. Eur. J. Oper. Res. 273(1): 67-73 (2019) - [j74]Feifeng Zheng, Michael L. Pinedo, Kangbok Lee
Towards robustness of response times: minimising the maximum inter-completion time on parallel machines. Int. J. Prod. Res. 57(1): 182-199 (2019) - [j73]Edmund K. Burke, Michael L. Pinedo:
Journal of scheduling (2019). J. Sched. 22(1): 1-2 (2019) - [j72]Bomin Bian
Performance Analysis of Overtaking Maneuvers at Bus Stops with Tandem Berths. Transp. Sci. 53(2): 597-618 (2019) - 2018
- [j71]Ali Allahverdi, Erwin Pesch, Michael L. Pinedo, Frank Werner
Scheduling in manufacturing systems: new trends and perspectives. Int. J. Prod. Res. 56(19): 6333-6335 (2018) - [j70]Edmund K. Burke
Journal of Scheduling (2018). J. Sched. 21(1): 1 (2018) - [j69]Nicholas G. Hall, Yumei Huo, Benjamin Li, Michael L. Pinedo, Hairong Zhao:
In memoriam: Dr. Joseph Leung. J. Sched. 21(6): 579-580 (2018) - 2017
- [j68]Michael L. Pinedo, Yuqian Xu:
Operations in Financial Services: Processes, Technologies, and Risks. Found. Trends Technol. Inf. Oper. Manag. 11(3): 223-342 (2017) - [j67]Christos Zacharias
Managing Customer Arrivals in Service Systems with Multiple Identical Servers. Manuf. Serv. Oper. Manag. 19(4): 639-656 (2017) - [j66]Edmund K. Burke
Journal of Scheduling (2017). J. Sched. 20(1): 1 (2017) - 2016
- [j65]Cheng He, Joseph Y.-T. Leung, Kangbok Lee
Improved algorithms for single machine scheduling with release dates and rejections. 4OR 14(1): 41-55 (2016) - [j64]Cheng He, Joseph Y.-T. Leung, Kangbok Lee
Scheduling a single machine with parallel batching to minimize makespan and total rejection cost. Discret. Appl. Math. 204: 150-163 (2016) - [j63]Cheng He, Joseph Y.-T. Leung, Kangbok Lee
An improved binary search algorithm for the Multiple-Choice Knapsack Problem. RAIRO Oper. Res. 50(4-5): 995-1001 (2016) - [j62]Edmund K. Burke
Journal of Scheduling (2016). J. Sched. 19(1): 1 (2016) - 2015
- [j61]Lei Lei, Michael L. Pinedo, Lian Qi, Shengbin Wang, Jian Yang:
Personnel scheduling and supplies provisioning in emergency relief operations. Ann. Oper. Res. 235(1): 487-515 (2015) - [j60]Michael L. Pinedo:
"Multiagent Scheduling - Models and Algorithms" By A. Agnetis, J.-C. Billaut, S. Gawiejnowicz, D. Pacciarelli, A. Soukhal. Eur. J. Oper. Res. 245(3): 877 (2015) - [j59]Edmund K. Burke
Journal of Scheduling (2015). J. Sched. 18(1): 1 (2015) - 2014
- [j58]Kangbok Lee
Fast approximation algorithms for bi-criteria scheduling with machine assignment costs. Eur. J. Oper. Res. 238(1): 54-64 (2014) - [j57]Kangbok Lee
Two dimensional load balancing. Oper. Res. Lett. 42(8): 539-544 (2014) - 2013
- [j56]Kangbok Lee
Makespan minimization in online scheduling with machine eligibility. Ann. Oper. Res. 204(1): 189-222 (2013) - [j55]Abel Cadenillas, Peter Lakner, Michael L. Pinedo:
Optimal Production Management When Demand Depends on the Business Cycle. Oper. Res. 61(4): 1046-1062 (2013) - [j54]Michael L. Pinedo, Josh Reed:
The "least flexible job first" rule in scheduling and in queueing. Oper. Res. Lett. 41(6): 618-621 (2013) - [j53]Edmund K. Burke
Journal of Scheduling (2013). J. Sched. 16(1): 1-2 (2013) - 2012
- [j52]Kangbok Lee
Coordination mechanisms for parallel machine scheduling. Eur. J. Oper. Res. 220(2): 305-313 (2012) - [j51]Edmund K. Burke
Editorial - Journal of Scheduling (2012). J. Sched. 15(1): 1-2 (2012) - 2011
- [j50]Kangbok Lee
Coordination mechanisms with hybrid local policies. Discret. Optim. 8(4): 513-524 (2011) - [j49]Byung-Cheon Choi
Minimizing makespan in an ordered flow shop with machine-dependent processing times. J. Comb. Optim. 22(4): 797-818 (2011) - [j48]Kangbok Lee
Scheduling jobs with equal processing times subject to machine eligibility constraints. J. Sched. 14(1): 27-38 (2011) - 2010
- [j47]Kangbok Lee
Makespan minimization in online scheduling with machine eligibility. 4OR 8(4): 331-364 (2010) - [j46]Guohua Wan
Scheduling two agents with controllable processing times. Eur. J. Oper. Res. 205(3): 528-539 (2010) - [j45]Byung-Cheon Choi
Flow shops with machine maintenance: Ordered and proportionate cases. Eur. J. Oper. Res. 207(1): 97-104 (2010) - [j44]Dirk Briskorn
Complexity of single machine scheduling subject to nonnegative inventory constraints. Eur. J. Oper. Res. 207(2): 605-619 (2010) - [j43]Joseph Y.-T. Leung, Michael L. Pinedo, Guohua Wan
Competitive Two-Agent Scheduling and Its Applications. Oper. Res. 58(2): 458-469 (2010) - [j42]Abel Cadenillas, Peter Lakner, Michael L. Pinedo:
Optimal Control of a Mean-Reverting Inventory. Oper. Res. 58(6): 1697-1710 (2010) - [j41]Byung-Cheon Choi
A note on makespan minimization in proportionate flow shops. Inf. Process. Lett. 111(2): 77-81 (2010) - [j40]Byung-Cheon Choi
Complexity of a scheduling problem with controllable processing times. Oper. Res. Lett. 38(2): 123-126 (2010) - [j39]Edmund K. Burke
Editorial. J. Sched. 13(1): 1 (2010) - [j38]Stefan Bock
A decomposition scheme for single stage scheduling problems. J. Sched. 13(3): 203-212 (2010)
2000 – 2009
- 2009
- [j37]Kangbok Lee
A note on "An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs". Inf. Process. Lett. 109(12): 608-610 (2009) - [j36]Kangbok Lee
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time. Inf. Process. Lett. 109(16): 913-917 (2009) - [j35]Kangbok Lee
A note on graph balancing problems with restrictions. Inf. Process. Lett. 110(1): 24-29 (2009) - [j34]Milind Dawande
Multiple Part-Type Production in Robotic Cells: Equivalence of Two Real-World Models. Manuf. Serv. Oper. Manag. 11(2): 210-228 (2009) - [j33]Edmund K. Burke
Editorial. J. Sched. 12(1): 1-2 (2009) - [j32]Kangbok Lee
Online scheduling on two uniform machines subject to eligibility constraints. Theor. Comput. Sci. 410(38-40): 3975-3981 (2009) - 2008
- [j31]Graham Kendall
Preface. Ann. Oper. Res. 159(1): 1-3 (2008) - [j30]Joseph Y.-T. Leung, Haibing Li, Michael L. Pinedo:
Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time. Ann. Oper. Res. 159(1): 107-123 (2008) - [j29]Michael L. Pinedo, Steef L. van de Velde:
Editorial 10th anniversary volume (volume 11). J. Sched. 11(1): 1 (2008) - 2007
- [j28]Joseph Y.-T. Leung, Haibing Li, Michael L. Pinedo:
Scheduling orders for multiple product types to minimize total weighted completion time. Discret. Appl. Math. 155(8): 945-970 (2007) - [j27]Joseph Y.-T. Leung, Haibing Li, Michael L. Pinedo, Jiawei Zhang:
Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines. Inf. Process. Lett. 103(3): 119-129 (2007) - [j26]Guohua Wan
Scheduling imprecise computation tasks on uniform processors. Inf. Process. Lett. 104(2): 45-52 (2007) - [j25]Edmund K. Burke
Editorial. J. Sched. 10(1): 3-4 (2007) - 2006
- [j24]Joseph Y.-T. Leung, Haibing Li, Michael L. Pinedo:
Scheduling orders for multiple product types with due date related objectives. Eur. J. Oper. Res. 168(2): 370-389 (2006) - [j23]Edmund K. Burke
Editorial. J. Sched. 9(1): 5 (2006) - [j22]Teofilo F. Gonzalez, Joseph Y.-T. Leung, Michael L. Pinedo:
Minimizing total completion time on uniform machines with deadline constraints. ACM Trans. Algorithms 2(1): 95-115 (2006) - [e1]John W. Fowler, Barry L. Nelson, Michael L. Pinedo, Oliver Rose:
Simulation & Scheduling: Companions or Competitors for Improving the Performance of Manufacturing Systems, 10.-15. July 2005. Dagstuhl Seminar Proceedings 05281, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - 2005
- [j21]Joseph Y.-T. Leung, Haibing Li, Michael L. Pinedo, Chelliah Sriskandarajah:
Open shops with jobs overlap - revisited. Eur. J. Oper. Res. 163(2): 569-571 (2005) - [j20]Edmund K. Burke
Editorial. J. Sched. 8(1): 5 (2005) - [j19]Joseph Y.-T. Leung, Haibing Li, Michael L. Pinedo:
Order Scheduling in an Environment with Dedicated Resources in Parallel. J. Sched. 8(5): 355-386 (2005) - [i2]John W. Fowler, Barry L. Nelson, Michael L. Pinedo, Oliver Rose:
05281 Executive Summary - Simulation & Scheduling: Companions or Competitors for Improving the Performance of Manufacturing Systems. Simulation & Scheduling 2005 - [i1]John W. Fowler, Barry L. Nelson, Michael L. Pinedo, Oliver Rose:
05281 Abstracts Collection - Simulation & Scheduling: Companions or Competitors for Improving the Performance of Manufacturing Systems. Simulation & Scheduling 2005 - 2004
- [j18]Edmund K. Burke, Michael L. Pinedo, Steef L. van de Velde:
Editorial. J. Sched. 7(1): 5 (2004) - [r1]Michael L. Pinedo:
Offline Deterministic Scheduling, Stochastic Scheduling, and Online Deterministic Scheduling. Handbook of Scheduling 2004 - 2003
- [j17]Joseph Y.-T. Leung, Michael L. Pinedo:
Minimizing Total Completion Time on Parallel Machines with Deadline Constraints. SIAM J. Comput. 32(5): 1370-1388 (2003)
1990 – 1999
- 1999
- [b1]Xiuli Chao, Masakiyo Miyazawa, Michael L. Pinedo:
Queueing networks - customers, signals and product form solutions. Wiley-Interscience series in systems and optimization, Wiley 1999, ISBN 978-0-471-98309-5, pp. I-XII, 1-445 - 1997
- [j16]Chung-Yee Lee, Lei Lei, Michael L. Pinedo:
Current trends in deterministic scheduling. Ann. Oper. Res. 70: 1-41 (1997) - [j15]Michael L. Pinedo, Benjamin P.-C. Yen:
On the design and development of object-oriented scheduling systems. Ann. Oper. Res. 70: 359-378 (1997) - [j14]Young Hoon Lee, Michael L. Pinedo:
Scheduling jobs on parallel machines with sequence-dependent setup times. Eur. J. Oper. Res. 100(3): 464-474 (1997) - 1995
- [j13]S. Thomas McCormick, Michael L. Pinedo:
Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis. INFORMS J. Comput. 7(1): 63-77 (1995) - [j12]Xiuli Chao, Michael L. Pinedo:
Networks of queues with batch services, signals and product form solutions. Oper. Res. Lett. 17(5): 237-242 (1995) - 1993
- [j11]Leonard Adler, Nelson M. Fraiman, Edward Kobacker, Michael L. Pinedo, Juan Carlos Plotnicoff, Tso Pang Wu:
BPSS: A Scheduling Support System for the Packaging Industry. Oper. Res. 41(4): 641-648 (1993) - [j10]Brian Thomas Eck, Michael L. Pinedo:
On the Minimization of the Makespan Subject to Flowtime Optimality. Oper. Res. 41(4): 797-801 (1993) - 1990
- [j9]C.-S. Chang, Michael L. Pinedo:
Bounds and Inequalities for Single Server Loss Systems. Queueing Syst. Theory Appl. 6(4): 425-435 (1990)
1980 – 1989
- 1989
- [j8]S. Thomas McCormick, Michael L. Pinedo, Scott Shenker, Barry Wolf:
Sequencing in an Assembly Line with Blocking to Minimize Cycle Time. Oper. Res. 37(6): 925-935 (1989) - 1987
- [j7]Michael L. Pinedo, Gideon Weiss:
The "Largest Variance First" Policy in Some Stochastic Scheduling Problems. Oper. Res. 35(6): 884-891 (1987) - 1986
- [j6]Sung-Hwan Wie, Michael L. Pinedo:
On Minimizing the Expected Makespan and Flow Time in Stochastic Flow Shops with Blocking. Math. Oper. Res. 11(2): 336-342 (1986) - 1985
- [j5]Michael L. Pinedo, Gideon Weiss:
Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines. Oper. Res. 33(6): 1381-1388 (1985) - 1984
- [j4]Michael L. Pinedo:
Optimal policies in stochastic shop scheduling. Ann. Oper. Res. 1(3): 305-329 (1984) - 1983
- [j3]Michael L. Pinedo:
Stochastic Scheduling with Release Dates and Due Dates. Oper. Res. 31(3): 559-572 (1983) - 1982
- [j2]Michael L. Pinedo:
Minimizing the Expected Makespan in Stochastic Flow Shops. Oper. Res. 30(1): 148-162 (1982) - [j1]Michael L. Pinedo, Ronald W. Wolff:
A Comparison Between Tandem Queues with Dependent and Independent Service Times. Oper. Res. 30(3): 464-479 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: