Michael L. Pinedo
According to our database1,
Michael L. Pinedo
authored at least 82 papers
between 1982 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
On csauthors.net:
Bibliography
2021
A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions.
Eur. J. Oper. Res., 2021
Ann. Oper. Res., 2021
2020
Operational Risk Management: A Stochastic Control Framework with Preventive and Corrective Controls.
Oper. Res., 2020
Eur. J. Oper. Res., 2020
2019
Transp. Sci., 2019
Towards robustness of response times: minimising the maximum inter-completion time on parallel machines.
Int. J. Prod. Res., 2019
Eur. J. Oper. Res., 2019
2018
Int. J. Prod. Res., 2018
2017
Manuf. Serv. Oper. Manag., 2017
Found. Trends Technol. Inf. Oper. Manag., 2017
2016
RAIRO Oper. Res., 2016
Scheduling a single machine with parallel batching to minimize makespan and total rejection cost.
Discret. Appl. Math., 2016
4OR, 2016
2015
"Multiagent Scheduling - Models and Algorithms" By A. Agnetis, J.-C. Billaut, S. Gawiejnowicz, D. Pacciarelli, A. Soukhal.
Eur. J. Oper. Res., 2015
Ann. Oper. Res., 2015
2014
Fast approximation algorithms for bi-criteria scheduling with machine assignment costs.
Eur. J. Oper. Res., 2014
2013
Oper. Res. Lett., 2013
Oper. Res., 2013
Ann. Oper. Res., 2013
2012
2011
Scheduling jobs with equal processing times subject to machine eligibility constraints.
J. Sched., 2011
J. Comb. Optim., 2011
2010
Oper. Res. Lett., 2010
Inf. Process. Lett., 2010
Eur. J. Oper. Res., 2010
Complexity of single machine scheduling subject to nonnegative inventory constraints.
Eur. J. Oper. Res., 2010
2009
Theor. Comput. Sci., 2009
Multiple Part-Type Production in Robotic Cells: Equivalence of Two Real-World Models.
Manuf. Serv. Oper. Manag., 2009
A note on "An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs".
Inf. Process. Lett., 2009
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time.
Inf. Process. Lett., 2009
2008
Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time.
Ann. Oper. Res., 2008
2007
Inf. Process. Lett., 2007
Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines.
Inf. Process. Lett., 2007
Scheduling orders for multiple product types to minimize total weighted completion time.
Discret. Appl. Math., 2007
2006
ACM Trans. Algorithms, 2006
Eur. J. Oper. Res., 2006
2005
J. Sched., 2005
05281 Abstracts Collection - Simulation & Scheduling: Companions or Competitors for Improving the Performance of Manufacturing Systems.
Proceedings of the Simulation & Scheduling: Companions or Competitors for Improving the Performance of Manufacturing Systems, 2005
05281 Executive Summary - Simulation & Scheduling: Companions or Competitors for Improving the Performance of Manufacturing Systems.
Proceedings of the Simulation & Scheduling: Companions or Competitors for Improving the Performance of Manufacturing Systems, 2005
2004
Offline Deterministic Scheduling, Stochastic Scheduling, and Online Deterministic Scheduling.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004
2003
SIAM J. Comput., 2003
1999
Queueing networks - customers, signals and product form solutions.
Wiley-Interscience series in systems and optimization, Wiley, ISBN: 978-0-471-98309-5, 1999
1997
Eur. J. Oper. Res., 1997
Ann. Oper. Res., 1997
1995
Oper. Res. Lett., 1995
Scheduling <i>n</i> Independent Jobs on <i>m</i> Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis.
INFORMS J. Comput., 1995
1993
1990
Queueing Syst. Theory Appl., 1990
1989
Oper. Res., 1989
1987
Oper. Res., 1987
1986
On Minimizing the Expected Makespan and Flow Time in Stochastic Flow Shops with Blocking.
Math. Oper. Res., 1986
1985
Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines.
Oper. Res., 1985
1984
1983
1982
Oper. Res., 1982