Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Jean-Marie Proth
Information about the author Jean-Marie Proth will soon be added to the site.
Found
25 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Algorithms for partitioning of large routing networks
2010
Partitioning of large networks is vital for decentralized management and control. This...
Single Machine Scheduling and Due Date Assignment under series–parallel precedence constraints
2005
We consider a single machine due date assignment and scheduling problem of minimizing...
Insertion of a random task in a schedule: a real-time approach
2005
We consider a set of tasks defined by their duration and their due-date. They are...
Analysis of a supply chain partnership with revenue sharing
2005
The profit margins of retailers and providers are becoming smaller as a greater number...
Strategic capacity planning in supply chain design for a new market opportunity
2004
This paper addresses the problem of supply chain design at the strategic level when...
Conditions of polynomial solvability and upper bounds for the optimum of the traveling salesman problem
2003
A system of linear inequalities is described that defines the set of real-valued...
Insertion of a random bitask in a schedule: a real-time approach
2004
We consider a schedule of bitasks. A bitask is a pair of tasks separated by an idle...
Multifunction radar: task scheduling
2002
Multifunction radar has to perform several types of tasks. Some of them are...
The concave cost supply problem
2003
This paper is divided into two parts. In the first part, we consider the case where...
A survey of the state-of-the-art of common due date assignment and scheduling research
2002
We aim at providing a unified framework of the common due date assignment and...
On-line scheduling in assembly processes
2001
The assembly system under consideration is composed with several machines, and some of...
On-line scheduling in a surface treatment system
2000
A real-time scheduling algorithm which guarantees an optimal completion time to each...
The cutting stock problem wih mixed objectives: Two heuristics based on dynamic programming
1999
The purpose of this paper is to provide efficient methods for solving a large spectrum...
Predictive maintenance: The one-unit replacement model
1998
Predictive maintenance consists in deciding whether or not to maintain a system...
Scheduling of piecewise constant product flows: A Petri net approach
1998
Scheduling a manufacturing system is usually an NP-hard problem. This means that only...
A dual ascent approach to the fixed-charge capacitated network design problem
1996
In this paper we consider the problem of constructing a network over which a number of...
Heuristics for unrelated machine scheduling with precedence constraints
1997
In this paper, we consider the problem of scheduling tasks on unrelated parallel...
Improving job-shop schedules through critical pairwise exchanges
1998
In this paper, we consider a job-shop scheduling problem. The criterion to be...
Heuristic approaches for n/m/F/&Sgr;Ci scheduling problems
1997
In this paper, we address the flow shop scheduling problem, with the criterion of...
Heuristic procedures for minimizing makespan and the number of required pallets
1995
A heuristic procedure is developed for minimizing makespan in flow-shop scheduling...
Sequencing of parts in robotic cells
1997
This paper considers scheduling problems in robotic cells that produce a set of part...
Production management in a Petri net environment
1995
The objective of this paper is to show that Petri nets facilitate a comprehensive...
CLASS: Computerized layout solutions using simulated annealing
1992
A new method ( C omputerized LA yout S olutions using S imulated annealing - CLASS)...
A planning horizon algorithm for deterministic inventory management with piecewise linear concave costs
1991
The authors consider a single-product, discrete-time production/inventory-control...
1
2
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers