| Publication | Date of Publication | Type |
|---|
Min-max relative regret for scheduling to minimize maximum lateness
Annals of Operations Research | 2025-08-09 | Paper |
Minimizing the maximum lateness for scheduling with release times and job rejection
Journal of Combinatorial Optimization | 2024-12-03 | Paper |
Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan
RAIRO. Operations Research | 2024-08-27 | Paper |
Min-max relative regret for scheduling to minimize maximum lateness
Lecture Notes in Computer Science | 2023-12-22 | Paper |
Scheduling on hybrid platforms: improved approximability window
(available as arXiv preprint) | 2022-10-13 | Paper |
Exact algorithms for scheduling programs with shared tasks
Journal of Combinatorial Optimization | 2022-07-18 | Paper |
Competitive difference analysis of the cash management problem with uncertain demands
European Journal of Operational Research | 2020-02-11 | Paper |
Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines
Annals of Operations Research | 2020-01-20 | Paper |
Complexity results for common due date scheduling problems with interval data and minmax regret criterion
Discrete Applied Mathematics | 2019-06-20 | Paper |
Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
Algorithmica | 2018-10-18 | Paper |
Scheduling jobs and maintenance activities on parallel machines
Operational Research. An International Journal | 2017-06-29 | Paper |
Unrelated parallel machine scheduling problem with precedence constraints: polyhedral analysis and branch-and-cut
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
Journal of Combinatorial Optimization | 2016-10-12 | Paper |
Semi-online scheduling on a single machine with unexpected breakdown
Theoretical Computer Science | 2016-08-31 | Paper |
A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization
Applied Mathematics and Computation | 2016-06-21 | Paper |
An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs
Journal of Industrial and Management Optimization | 2015-12-18 | Paper |
Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals
Journal of Combinatorial Optimization | 2015-09-28 | Paper |
Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times
Discrete Applied Mathematics | 2015-09-22 | Paper |
Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem
Applied Mathematics and Computation | 2014-11-13 | Paper |
| A linear programming approach for the three-dimensional bin-packing problem | 2013-11-08 | Paper |
Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability
Discrete Optimization | 2013-03-13 | Paper |
Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
Computers & Operations Research | 2012-11-15 | Paper |
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
RAIRO - Operations Research | 2012-10-10 | Paper |
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
RAIRO - Operations Research | 2012-10-10 | Paper |
Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
| Single machine scheduling with a common due date: total weighted tardiness problems | 2012-01-26 | Paper |
Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates
Journal of Scheduling | 2011-10-18 | Paper |
An exact method for the 2D guillotine strip packing problem
Advances in Operations Research | 2010-11-16 | Paper |
Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
Discrete Applied Mathematics | 2010-10-11 | Paper |
Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
European Journal of Operational Research | 2009-12-07 | Paper |
Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
Journal of Combinatorial Optimization | 2009-09-18 | Paper |
Approximation algorithms for single machine scheduling with one unavailability period
4OR | 2009-06-22 | Paper |
| Lower bounds for tardiness minimization on a single machine with family setup times | 2008-08-12 | Paper |
Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
European Journal of Operational Research | 2008-01-21 | Paper |
Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
Computers & Operations Research | 2007-10-19 | Paper |
| scientific article; zbMATH DE number 2214471 (Why is no real title available?) | 2005-10-17 | Paper |
| scientific article; zbMATH DE number 2050755 (Why is no real title available?) | 2004-03-07 | Paper |
Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
Mathematics and Computers in Simulation | 2002-12-02 | Paper |
