Eric Pinson

According to our database1, Eric Pinson authored at least 19 papers between 1997 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
A data structure for efficiently managing a set of energy functions.
J. Comb. Optim., 2022

A faster checker of the energetic reasoning for the cumulative scheduling problem.
Int. J. Prod. Res., 2022

2020
An <i>O</i>(<i>n</i><sup>2</sup>) algorithm for time-bound adjustments for the cumulative scheduling problem.
Eur. J. Oper. Res., 2020

2018
Solving a wind turbine maintenance scheduling problem.
J. Sched., 2018

2017
A branch-and-check approach for a wind turbine maintenance scheduling problem.
Comput. Oper. Res., 2017

2016
Maintenance scheduling in the electricity industry: A literature review.
Eur. J. Oper. Res., 2016

2014
Branch-and-price approach for the multi-skill project scheduling problem.
Optim. Lett., 2014

Solving an integrated job-shop problem with human resource constraints.
Ann. Oper. Res., 2014

2013
Combinatorial optimization in production and logistics systems.
RAIRO Oper. Res., 2013

2010
Cut generation for an integrated employee timetabling and production scheduling problem.
Eur. J. Oper. Res., 2010

Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates.
Eur. J. Oper. Res., 2010

2009
Cut generation for an employee timetabling problem.
Eur. J. Oper. Res., 2009

2004
Elimination Rules for Job-Shop Scheduling Problem.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Jackson's pseudo-preemptive schedule and cumulative scheduling problems.
Discret. Appl. Math., 2004

A Branch and Bound Algorithm to Minimize Total Weighted Tardiness on a Single Processor.
Ann. Oper. Res., 2004

2003
Using short-term memory to minimize the weighted number of late jobs on a single machine.
Eur. J. Oper. Res., 2003

A branch and bound to minimize the number of late jobs on a single machine with release time constraints.
Eur. J. Oper. Res., 2003

1998
Jackson's Pseudo Preemptive Schedule for the <i>Pm</i>/<i>r</i> <sub> <i>i</i> </sub>, <i>q</i> <sub> <i>i</i> </sub>/<i>C</i> <sub> <i>max</i> </sub> scheduling problem.
Ann. Oper. Res., 1998

1997
Bounds and adjustments associated with the Pm/r<sub>i</sub>, q<sub>i</sub>/Cmax scheduling problem.
Proceedings of the JFPLC'97, 1997


  Loading...