Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
J. Carlier
Information about the author J. Carlier will soon be added to the site.
Found
9 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
On linear lower bounds for the resource constrained project scheduling problem
2003
The aim of this paper is to propose efficient methods for solving the resource...
An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system
1999
The aim of this paper is to present a branch and bound method for minimizing the...
Task decomposition for a bus multiprocessor: properties of optimal schedules
1997
A bus oriented multiprocessor contains one bus system to which all the processors are...
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
1994
The efficiency of recent enumerative methods for the job-shop problem crucially...
Scheduling problems
1993
Although recent methods used for designing production systems tend to reduce the size...
A new heuristic for the Traveling Salesman Problem
1990
In this paper the authors present a new heuristic for the Traveling Salesman 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
1989
In this paper, the authors propose a branch and bound method for solving the job-shop...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers