Complexity results for storage loading problems with stacking constraints von Bruns, Florian, Knust, Sigrid, Shakhlevich, Natalia V.

Volltext

Preemptive scheduling of parallel jobs of two sizes with controllable processing times von Shioura, Akiyoshi, Strusevich, Vitaly A., Shakhlevich, Natalia V.

Volltext

Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques von Shioura, Akiyoshi, Strusevich, Vitaly A., Shakhlevich, Natalia V.

Volltext

Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost von Shioura, Akiyoshi, Shakhlevich, Natalia V., Strusevich, Vitaly A.

Volltext

Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times von Shioura, Akiyoshi, Shakhlevich, Natalia V., Strusevich, Vitaly A.

Volltext

Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines von Shioura, Akiyoshi, Shakhlevich, Natalia V, Strusevich, Vitaly A

Volltext

Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines von Brucker, Peter, Shakhlevich, Natalia V.

Volltext

Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints von Shioura, Akiyoshi, Shakhlevich, Natalia V, Strusevich, Vitaly A

Volltext

Scheduling Bag-of-Tasks Applications to Optimize Computation Time and Cost von Grekioti, Anastasia, Shakhlevich, Natalia V.

Volltext

Tabu search and lower bounds for a combined production–transportation problem von Condotta, Alessandro, Knust, Sigrid, Meier, Dimitri, Shakhlevich, Natalia V.

Volltext

Models and algorithms for energy-efficient scheduling with immediate start of jobs von Shioura, Akiyoshi, Shakhlevich, Natalia V., Strusevich, Vitaly A., Primas, Bernhard

Volltext

Minimising the number of gap-zeros in binary matrices von Chakhlevitch, Konstantin, Glass, Celia A., Shakhlevich, Natalia V.

Volltext

Inverse scheduling: two-machine flow-shop problem von Brucker, Peter, Shakhlevich, Natalia V.

Volltext

Inverse scheduling with maximum lateness objective von Brucker, Peter, Shakhlevich, Natalia V.

Volltext

A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines von Shioura, Akiyoshi, Shakhlevich, Natalia V., Strusevich, Vitaly A.

Volltext

Parallel batch scheduling of equal-length jobs with release and due dates von Condotta, Alessandro, Knust, Sigrid, Shakhlevich, Natalia V.

Volltext

Classification and evaluation of the algorithms for vector bin packing von Mommessin, Clément, Erlebach, Thomas, Shakhlevich, Natalia V.

Volltext

Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches von Shioura, Akiyoshi, Shakhlevich, Natalia V., Strusevich, Vitaly A.

Volltext

Single machine scheduling with controllable release and processing parameters von Shakhlevich, Natalia V., Strusevich, Vitaly A.

Volltext

A polynomial-time algorithm for a flow-shop batching problem with equal-length operations von Brucker, Peter, Shakhlevich, Natalia V.

Volltext