Lawler's minmax cost problem under uncertainty.
J. Comb. Optim., 2017
Lawler's minmax cost algorithm: optimality conditions and uncertainty.
J. Sched., 2016
Parallel-machine scheduling with maintenance: Praising the assignment problem.
Eur. J. Oper. Res., 2016
Identical coupled task scheduling: polynomial complexity of the cyclic case.
J. Sched., 2015
Single machine scheduling with small operator-non-availability periods.
J. Sched., 2012
Two classical transportation problems revisited: Pure constant fixed charges and the paradox.
Math. Comput. Model., 2011
On the complexity of the independent set problem in triangle graphs.
Discret. Math., 2011
The complexity of dissociation set problems in graphs.
Discret. Appl. Math., 2011
Comparaison de différentes formulations de conception de réseaux pour un problème de transport de fret avec gestion de véhicules.
Stud. Inform. Univ., 2010
Minimizing the number of machines for minimum length schedules.
Eur. J. Oper. Res., 2009
Flowshop scheduling problem with a batching machine and task compatibilities.
Comput. Oper. Res., 2009
Scheduling of coupled tasks and one-machine no-wait robotic cells.
Comput. Oper. Res., 2009
Operator non-availability periods.
4OR, 2009
Approximability results for the maximum and minimum maximal induced matching problems.
Discret. Optim., 2008
Batch processing with interval graph compatibilities between tasks.
Discret. Appl. Math., 2008
Total Completion Time in a Two-machine Flowshop with Deteriorating Tasks.
J. Math. Model. Algorithms, 2007
Models and Complexity of Multibin Packing Problems.
J. Math. Model. Algorithms, 2006
Well Solvable Cases of the Quadratic Assignment Problem with Monotone and Bimonotone Matrices.
J. Math. Model. Algorithms, 2006
Specializing Narrowing for Timetable Generation: A Case Study.
Proceedings of the Practical Aspects of Declarative Languages, 7th International Symposium, 2005
Robotic Cells: Configurations, Conjectures and Cycle Functions.
Proceedings of the Operations Research Proceedings 2005, 2005
Scheduling with Discrete Resource Constraints.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004
2-Objective Optimization of Cells Overlap and Geometry with Evolutionary Algorithms.
Proceedings of the Applications of Evolutionary Computing, 2004
Complexity of One-Cycle Robotic Flow-Shops.
J. Sched., 2003
Approximation algorithms for the design of SDH/SONET networks.
RAIRO Oper. Res., 2003
Scheduling with common due date assignment.
Proceedings of 8th IEEE International Conference on Emerging Technologies and Factory Automation, 2001
k-server problems with bulk requests: an application to tool switching in manufacturing.
Ann. Oper. Res., 2000
On the complexity of a restricted list-coloring problem.
Discret. Math., 1999
A Variant of the Permutation Flow Shop Model with Variable Processing Times.
Discret. Appl. Math., 1997
Modelling a tool switching problem on a single NC-machine.
J. Intell. Manuf., 1995
Proceedings of the Information Management in Computer Integrated Manufacturing: A Comprehensive Guide to State-of-the-Art CIM Solutions, 1995
An integrated system for scheduling machines and vehicles in an FMS.
Proceedings of the 1991 IEEE International Conference on Robotics and Automation, 1991
Selection of process plans in automated manufacturing systems.
IEEE J. Robotics Autom., 1988
Minimizing Mean Weighted Execution Time Loss on Identical and Uniform Processors.
Inf. Process. Lett., 1987
Hierarchical approach to the process planning problem.
Discret. Appl. Math., 1987
Discret. Appl. Math., 1987
The process plan selection problem.
Proceedings of the 1986 IEEE International Conference on Robotics and Automation, 1986
Degeneracy in fixed cost transportation problems.
Math. Program., 1975
Merging and Sorting Applied to the Zero-One Knapsack Problem.
Oper. Res., 1975