| Publication | Date of Publication | Type |
|---|
Classification and evaluation of the algorithms for vector bin packing
Computers & Operations Research | 2025-05-26 | Paper |
Preemptive scheduling of parallel jobs of two sizes with controllable processing times
Journal of Scheduling | 2024-05-30 | Paper |
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques
Networks | 2024-03-15 | Paper |
Scheduling divisible loads with time and cost constraints
Journal of Scheduling | 2022-01-14 | Paper |
Machine speed scaling by adapting methods for convex optimization with submodular constraints
INFORMS Journal on Computing | 2020-11-09 | Paper |
Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
Journal of Global Optimization | 2020-04-21 | Paper |
Models and algorithms for energy-efficient scheduling with immediate start of jobs
Journal of Scheduling | 2019-08-08 | Paper |
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
European Journal of Operational Research | 2018-05-30 | Paper |
Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines
Journal of Scheduling | 2018-02-28 | Paper |
Handling scheduling problems with controllable parameters by methods of submodular optimization
Discrete Optimization and Operations Research | 2018-02-13 | Paper |
Tabu search and lower bounds for a combined production-transportation problem
Computers & Operations Research | 2016-11-14 | Paper |
The assignment problem with nearly Monge arrays and incompatible partner indices
Discrete Applied Mathematics | 2016-11-02 | Paper |
Complexity results for storage loading problems with stacking constraints
European Journal of Operational Research | 2016-10-07 | Paper |
Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
INFORMS Journal on Computing | 2016-05-19 | Paper |
Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
Mathematical Programming. Series A. Series B | 2015-10-19 | Paper |
Minimising the number of gap-zeros in binary matrices
European Journal of Operational Research | 2015-07-28 | Paper |
A note on reverse scheduling with maximum lateness objective
Journal of Scheduling | 2014-08-18 | Paper |
A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Scheduling coupled-operation jobs with exact time-lags
Discrete Applied Mathematics | 2012-10-19 | Paper |
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations
Journal of Scheduling | 2012-01-16 | Paper |
Inverse scheduling: Two-machine flow-shop problem
Journal of Scheduling | 2011-10-18 | Paper |
Parallel batch scheduling of equal-length jobs with release and due dates
Journal of Scheduling | 2010-11-03 | Paper |
Inverse scheduling with maximum lateness objective
Journal of Scheduling | 2009-12-02 | Paper |
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
International Journal of Foundations of Computer Science | 2009-06-23 | Paper |
Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Preemptive scheduling on uniform parallel machines with controllable job processing times
Algorithmica | 2008-07-01 | Paper |
Two-machine open shop problem with controllable processing times
Discrete Optimization | 2008-01-18 | Paper |
Pre-emptive scheduling problems with controllable processing times
Journal of Scheduling | 2007-05-15 | Paper |
Single machine scheduling with controllable release and processing parameters
Discrete Applied Mathematics | 2006-10-30 | Paper |
Scheduling with controllable release dates and processing times: Makespan minimization
European Journal of Operational Research | 2006-10-27 | Paper |
Scheduling with controllable release dates and processing times: total completion time minimization
European Journal of Operational Research | 2006-10-27 | Paper |
Open shop unit-time scheduling problems with symmetric objective functions
4OR | 2006-03-09 | Paper |
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
European Journal of Operational Research | 2005-04-21 | Paper |
| Three-machine shop scheduling with partially ordered processing routes | 2005-03-14 | Paper |
Complexity results for flow-shop and open-shop scheduling problems with transportation delays
Annals of Operations Research | 2004-08-10 | Paper |
Single machine scheduling of unit-time jobs with controllable release dates
Journal of Global Optimization | 2003-09-15 | Paper |
Common due date assignment and scheduling with ready times
Computers & Operations Research | 2003-04-02 | Paper |
Proportionate flow shop with controllable processing times
Journal of Scheduling | 2000-04-03 | Paper |
Complexity of mixed shop scheduling problems: A survey
European Journal of Operational Research | 2000-03-19 | Paper |
Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
Annals of Operations Research | 2000-01-11 | Paper |
Minimizing total weighted completion time in a proportionate flow shop
Journal of Scheduling | 1999-01-11 | Paper |
On the solution region for certain scheduling problems with preemption
Annals of Operations Research | 1998-12-06 | Paper |
Adaptive scheduling algorithm based on mixed graph model
IET Control Theory & Applications | 1996-11-25 | Paper |
NP-hardness of shop-scheduling problems with three jobs
Discrete Applied Mathematics | 1996-05-13 | Paper |
A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs
The Journal of the Operational Research Society | 1996-04-29 | Paper |
| scientific article; zbMATH DE number 781213 (Why is no real title available?) | 1996-01-08 | Paper |
Scheduling two jobs with fixed and nonfixed routes
Computing | 1995-03-15 | Paper |
Optimal job-shop scheduling with two jobs in systems with unrestricted paths
Computational Mathematics and Mathematical Physics | 1994-07-06 | Paper |
Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
European Journal of Operational Research | 1993-12-20 | Paper |
| scientific article; zbMATH DE number 67591 (Why is no real title available?) | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 56358 (Why is no real title available?) | 1992-09-26 | Paper |
| scientific article; zbMATH DE number 4154198 (Why is no real title available?) | 1990-01-01 | Paper |
