Baptiste, Philippe.- CNRS & Laboratoire d�Informatique, �cole Polytechnique

Advanced Search

Baptiste, Philippe.- CNRS & Laboratoire d�Informatique, �cole Polytechnique

DISJUNCTIVE CONSTRAINTS FOR MANUFACTURING SCHEDULING: PRINCIPLES AND EXTENSIONS
TO BE PUBLISHED IN ANNALS OF OPERATIONS RESEARCH Satisfiability Tests and Time-Bound Adjustments
Scheduling Equal-Length Jobs on Identical Parallel Machines
On Scheduling a Single Machine to Minimize a Piecewise Linear Objective Function : A Compact MIP Formulation
Lagrangian Bounds for Just-In-Time Job-Shop Philippe Baptiste1
fvrier 09 1/12 Philippe Baptiste
Polynomial Time Algorithms for Minimizing the Weighted Number of Late Jobs on a Single Machine
Universit e de Technologie de Compi egne Laboratoire Heudiasyc, UMR CNRS 6599
SEQUENCING A SINGLE MACHINE WITH DUE DATES AND DEADLINES: AN ILP-BASED APPROACH TO SOLVE
A Branch and Bound to Mininimze the Number of Late Jobs on a Single Machine with Release Time
Operations Research Will be set by the publisher Recherche Op erationnelle
Programmation et Algorithmique INF 421, Ecole Polytechnique
A Note on Scheduling Identical Coupled Tasks in Constant Time
On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows
The K King Problem, an Abstract Model for Computing Aircraft Landing Trajectories
Lower Bounds for Parallel Machine Scheduling Problems Philippe Baptiste1
arXiv:cs/0605078v1[cs.DS]17May2006 The Complexity of Mean Flow Time Scheduling Problems
Arc-B-Consistency of the Inter-Distance Constraint K. Artiouchine Ph. Baptiste
Scheduling a Single Machine to Minimize a Regular Objective Function under Setup
RAIRO Operations Research Will be set by the publisher
OR Spektrum manuscript No. (will be inserted by the editor)
A Branch-and-Bound Procedure to Minimize Total Tardiness on One Machine with
A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize
Mathematical Methods of Operations Research manuscript No. (will be inserted by the editor)
Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly
TO BE PUBLISHED IN OPERATIONS RESEARCH LETTERS ) Algorithm for Preemptive Scheduling of a Single
Resource constraints for preemptive job-shop CLAUDE LE PAPE1
Universit de Technologie de Compigne, UMR CNRS 6599 HEUDIASYC UNE TUDE THORIQUE ET EXPRIMENTALE DE LA
Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling Problem
Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput