Pinson E.

E. Pinson

Information about the author E. Pinson will soon be added to the site.
Found 6 papers in total
Jackson's Pseudo Preemptive Schedule for the Pm/ri, qi /Cmax scheduling problem
Jackson's Pseudo Preemptive Schedule for the Pm/ri, qi /Cmax scheduling problem
1998
The aim of this paper is to introduce Jackson's Pseudo Preemptive Schedule (JPPS) for...
Adjustment of heads and tails for the job-shop problem
Adjustment of heads and tails for the job-shop problem
1994
The efficiency of recent enumerative methods for the job-shop problem crucially...
Scheduling problems
Scheduling problems
1993
Although recent methods used for designing production systems tend to reduce the size...
A practical use of Jackson’s preemptive schedule for solving the job shop problem
A practical use of Jackson’s preemptive schedule for solving the job shop problem
1990
In this paper, the authors present a polynomial algorithm for optimally adjusting...
An algorithm for solving the job-shop problem
An algorithm for solving the job-shop problem
1989
In this paper, the authors propose a branch and bound method for solving the job-shop...
Lower bounds to the Graph Partitioning Problem through generalized linear programming and network flows
Lower bounds to the Graph Partitioning Problem through generalized linear programming and network flows
1987
The well-known Graph Partitioning Problem (GPP), has many applications, both in its...
Papers per page: