Michael L. Pinedo

According to our database1, Michael L. Pinedo authored at least 82 papers between 1982 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Ideal schedules in parallel machine settings.
Eur. J. Oper. Res., 2021

A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions.
Eur. J. Oper. Res., 2021

New algorithms for minimizing the weighted number of tardy jobs on a single machine.
Ann. Oper. Res., 2021

2020
Journal of scheduling (2020).
J. Sched., 2020

Operational Risk Management: A Stochastic Control Framework with Preventive and Corrective Controls.
Oper. Res., 2020

Flow shops with reentry: Reversibility properties and makespan optimal schedules.
Eur. J. Oper. Res., 2020

Scheduling equal length jobs with eligibility restrictions.
Ann. Oper. Res., 2020

Parameterized Multi-Scenario Single-Machine Scheduling Problems.
Algorithmica, 2020

2019
Performance Analysis of Overtaking Maneuvers at Bus Stops with Tandem Berths.
Transp. Sci., 2019

Journal of scheduling (2019).
J. Sched., 2019

Towards robustness of response times: minimising the maximum inter-completion time on parallel machines.
Int. J. Prod. Res., 2019

Online scheduling of ordered flow shops.
Eur. J. Oper. Res., 2019

On the parameterized tractability of single machine scheduling with rejection.
Eur. J. Oper. Res., 2019

2018
In memoriam: Dr. Joseph Leung.
J. Sched., 2018

Journal of Scheduling (2018).
J. Sched., 2018

Scheduling in manufacturing systems: new trends and perspectives.
Int. J. Prod. Res., 2018

2017
Journal of Scheduling (2017).
J. Sched., 2017

Managing Customer Arrivals in Service Systems with Multiple Identical Servers.
Manuf. Serv. Oper. Manag., 2017

Operations in Financial Services: Processes, Technologies, and Risks.
Found. Trends Technol. Inf. Oper. Manag., 2017

2016
Journal of Scheduling (2016).
J. Sched., 2016

An improved binary search algorithm for the Multiple-Choice Knapsack Problem.
RAIRO Oper. Res., 2016

Scheduling a single machine with parallel batching to minimize makespan and total rejection cost.
Discret. Appl. Math., 2016

Improved algorithms for single machine scheduling with release dates and rejections.
4OR, 2016

2015
Journal of Scheduling (2015).
J. Sched., 2015

"Multiagent Scheduling - Models and Algorithms" By A. Agnetis, J.-C. Billaut, S. Gawiejnowicz, D. Pacciarelli, A. Soukhal.
Eur. J. Oper. Res., 2015

Personnel scheduling and supplies provisioning in emergency relief operations.
Ann. Oper. Res., 2015

2014
Two dimensional load balancing.
Oper. Res. Lett., 2014

Fast approximation algorithms for bi-criteria scheduling with machine assignment costs.
Eur. J. Oper. Res., 2014

2013
Journal of Scheduling (2013).
J. Sched., 2013

The "least flexible job first" rule in scheduling and in queueing.
Oper. Res. Lett., 2013

Optimal Production Management When Demand Depends on the Business Cycle.
Oper. Res., 2013

Makespan minimization in online scheduling with machine eligibility.
Ann. Oper. Res., 2013

2012
Editorial - Journal of Scheduling (2012).
J. Sched., 2012

Coordination mechanisms for parallel machine scheduling.
Eur. J. Oper. Res., 2012

2011
Scheduling jobs with equal processing times subject to machine eligibility constraints.
J. Sched., 2011

Minimizing makespan in an ordered flow shop with machine-dependent processing times.
J. Comb. Optim., 2011

Coordination mechanisms with hybrid local policies.
Discret. Optim., 2011

2010
Editorial.
J. Sched., 2010

A decomposition scheme for single stage scheduling problems.
J. Sched., 2010

Complexity of a scheduling problem with controllable processing times.
Oper. Res. Lett., 2010

A note on makespan minimization in proportionate flow shops.
Inf. Process. Lett., 2010

Competitive Two-Agent Scheduling and Its Applications.
Oper. Res., 2010

Optimal Control of a Mean-Reverting Inventory.
Oper. Res., 2010

Scheduling two agents with controllable processing times.
Eur. J. Oper. Res., 2010

Flow shops with machine maintenance: Ordered and proportionate cases.
Eur. J. Oper. Res., 2010

Complexity of single machine scheduling subject to nonnegative inventory constraints.
Eur. J. Oper. Res., 2010

2009
Online scheduling on two uniform machines subject to eligibility constraints.
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 graph balancing problems with restrictions.
Inf. Process. Lett., 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
Editorial 10th anniversary volume (volume 11).
J. Sched., 2008

Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time.
Ann. Oper. Res., 2008

Preface.
Ann. Oper. Res., 2008

2007
Scheduling imprecise computation tasks on uniform processors.
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
Minimizing total completion time on uniform machines with deadline constraints.
ACM Trans. Algorithms, 2006

Scheduling orders for multiple product types with due date related objectives.
Eur. J. Oper. Res., 2006

2005
Order Scheduling in an Environment with Dedicated Resources in Parallel.
J. Sched., 2005

Open shops with jobs overlap - revisited.
Eur. J. Oper. Res., 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
Minimizing Total Completion Time on Parallel Machines with Deadline Constraints.
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
Scheduling jobs on parallel machines with sequence-dependent setup times.
Eur. J. Oper. Res., 1997

On the design and development of object-oriented scheduling systems.
Ann. Oper. Res., 1997

Current trends in deterministic scheduling.
Ann. Oper. Res., 1997

1995
Networks of queues with batch services, signals and product form solutions.
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
On the Minimization of the Makespan Subject to Flowtime Optimality.
Oper. Res., 1993

BPSS: A Scheduling Support System for the Packaging Industry.
Oper. Res., 1993

1990
Bounds and Inequalities for Single Server Loss Systems.
Queueing Syst. Theory Appl., 1990

1989
Sequencing in an Assembly Line with Blocking to Minimize Cycle Time.
Oper. Res., 1989

1987
The "Largest Variance First" Policy in Some Stochastic Scheduling Problems.
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
Optimal policies in stochastic shop scheduling.
Ann. Oper. Res., 1984

1983
Stochastic Scheduling with Release Dates and Due Dates.
Oper. Res., 1983

1982
A Comparison Between Tandem Queues with Dependent and Independent Service Times.
Oper. Res., 1982

Minimizing the Expected Makespan in Stochastic Flow Shops.
Oper. Res., 1982


  Loading...