| Publication | Date of Publication | Type |
|---|
Single machine adversarial bilevel scheduling problems
European Journal of Operational Research | 2024-06-13 | Paper |
Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion
Journal of Scheduling | 2023-06-27 | Paper |
Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times
European Journal of Operational Research | 2022-12-12 | Paper |
Moderate exponential-time algorithms for scheduling problems
4OR | 2022-11-17 | Paper |
Single machine rescheduling for new orders with maximum lateness minimization
Computers & Operations Research | 2022-06-22 | Paper |
Exact solution of the two-machine flow shop problem with three operations
Computers & Operations Research | 2022-03-09 | Paper |
Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms
Applied Mathematics and Computation | 2021-11-09 | Paper |
Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes
RAIRO - Operations Research | 2021-07-27 | Paper |
\textit{Branch} \& \textit{memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
Computers & Operations Research | 2021-05-21 | Paper |
| Merging nodes in search trees: an exact exponential algorithm for the single machine total tardiness scheduling problem | 2020-05-27 | Paper |
Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
Journal of Combinatorial Optimization | 2020-03-24 | Paper |
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths
Journal of Scheduling | 2019-10-08 | Paper |
A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
A local branching heuristic for solving a graph edit distance problem
Computers & Operations Research | 2019-03-27 | Paper |
An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
Theoretical Computer Science | 2018-09-24 | Paper |
A constraint generation approach for two-machine shop problems with jobs selection
European Journal of Operational Research | 2018-05-25 | Paper |
Exact exponential algorithms for 3-machine flowshop scheduling problems
Journal of Scheduling | 2018-04-13 | Paper |
Minimizing the number of tardy jobs in two-machine settings with common due date
Journal of Combinatorial Optimization | 2017-10-17 | Paper |
A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment
Computers & Operations Research | 2016-11-11 | Paper |
A hybrid heuristic approach for single machine scheduling with release times
Computers & Operations Research | 2016-11-10 | Paper |
Scheduling evacuation operations
Journal of Scheduling | 2016-09-07 | Paper |
Erratum: One machine sequencing to minimize total tardiness: a fourth theorem for Emmons
Operations Research | 2015-11-20 | Paper |
A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Preprocessing for a map sectorization problem by means of mathematical programming
Annals of Operations Research | 2015-01-22 | Paper |
Two-agent scheduling on uniform parallel machines with min-max criteria
Annals of Operations Research | 2014-09-26 | Paper |
Scheduling batches in flowshop with limited buffers in the shampoo industry
European Journal of Operational Research | 2014-07-27 | Paper |
Scheduling two agents on uniform parallel machines with~makespan and cost functions
Journal of Scheduling | 2014-02-05 | Paper |
On an extension of the Sort \& Search method with application to scheduling theory
Theoretical Computer Science | 2014-01-13 | Paper |
Rescheduling for new orders on a single machine with setup times
European Journal of Operational Research | 2012-12-29 | Paper |
Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
Computers & Operations Research | 2012-11-15 | Paper |
Minimizing the number of late jobs when the start time of the machine is variable
Operations Research Letters | 2012-11-08 | Paper |
Enumeration of Pareto optima for a flowshop scheduling problem with two criteria
INFORMS Journal on Computing | 2012-06-18 | Paper |
Multicriteria models for just-in-time scheduling
International Journal of Production Research | 2011-05-10 | Paper |
Improving the preemptive bound for the single machine dynamic maximum lateness problem
Operations Research Letters | 2010-12-23 | Paper |
Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
Journal of Scheduling | 2010-05-07 | Paper |
Counting and enumeration complexity with application to multicriteria scheduling
Annals of Operations Research | 2008-03-31 | Paper |
Revisiting branch and bound search strategies for machine scheduling problems
Journal of Scheduling | 2007-12-20 | Paper |
| Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott. | 2007-02-23 | Paper |
A recovering beam search algorithm for the single machine just-in-time scheduling problem
European Journal of Operational Research | 2006-05-16 | Paper |
| Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott. | 2006-04-05 | Paper |
Counting and enumeration complexity with application to multicriteria scheduling
4OR | 2005-08-25 | Paper |
| scientific article; zbMATH DE number 2160610 (Why is no real title available?) | 2005-04-22 | Paper |
A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
The Journal of the Operational Research Society | 2005-03-14 | Paper |
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
Operations Research Letters | 2003-11-17 | Paper |
Two-machine flowshop scheduling with a secondary criterion
Computers & Operations Research | 2003-05-14 | Paper |
An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
European Journal of Operational Research | 2002-11-20 | Paper |
Multicriteria scheduling problems: a survey
RAIRO. Operations Research | 2002-04-21 | Paper |
Multicriteria scheduling problems: a survey
RAIRO. Operations Research | 2002-04-21 | Paper |
Multicriteria scheduling problems: a survey
RAIRO. Operations Research | 2002-04-21 | Paper |
Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
European Journal of Operational Research | 2001-01-01 | Paper |
