All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”
EN
ČeštinaEnglish

Filters

26 475 (0,111s) •

Result

A Stochastic-Integer Programming Approach to Tactical Fixed Interval Scheduling Problems

Fixed interval scheduling (FIS) problems arise in many areas of economics and industry where jobs with processing intervals known in advance are assigned as a tactical fixed interval schedulin...

Statistics and probability

  • 2017
    • •
  • D
Result

A Note on Fixed Interval Scheduling with Stochastic Elements

The Fixed Interval Scheduling (FIS) problem deals with scheduling of jobs to machines, where all the jobs have given fixed starting and finishing times. In this paper, we introduce a stochastic version of ...

AE - Řízení, správa a administrativa

  • 2015
    • •
  • Jx
Result

A note on fixed interval scheduling with stochastic elements

The Fixed Interval Scheduling (FIS) problem deals with scheduling of jobs to machines, where all the jobs have given ixed starting and inishing times. In this paper, we introduce a stochastic version of the FIS pro...

BB - Aplikovaná statistika, operační výzkum

  • 2015
    • •
  • Jx
    • •
  • Link
Result

Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times

We deal with fixed interval scheduling (FIS) problems on parallel identical machines where the job starting times are given but the finishing times are subject to uncertainty. In the operational problem, we construct a ...

Applied mathematics

  • 2018
    • •
  • Jimp
    • •
  • Link
Result

Fixed interval scheduling under uncertainty - A tabu search algorithm for an extended robust coloring formulation

We propose several formulations of the fixed interval scheduling problem under uncertainty, where the risk is represented by random delays in processing times. We employ various stochastic programming and robust coloring pr...

BB - Aplikovaná statistika, operační výzkum

  • 2016
    • •
  • Jx
    • •
  • Link
Result

Fixed interval scheduling under uncertainty - A tabu search algorithm for an extended robust coloring formulation

We propose several formulations of the fixed interval scheduling problem under uncertainty, where the risk is represented by random delays in processing times. We employ various stochastic programming and robust coloring pr...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2016
    • •
  • Jimp
    • •
  • Link
Result

Flow-based formulations for operational fixed interval scheduling problems with random delays

We deal with operational fixed interval scheduling problem with random delays in job processing times. We formulate two stochastic programming problems machines and the goal is to obtain a schedule with the highest...

Statistics and probability

  • 2017
    • •
  • Jimp
    • •
  • Link
Result

Optimal Scheduling of Vehicle Loading/Unloading Operations in Depots

We deal with the problem of optimal scheduling of cargo loading or unloading for a fleet of vehicles in depots. We show that it can lead to fixed interval scheduling where starting and finishing times of jobs are p...

Statistics and probability

  • 2022
    • •
  • D
    • •
  • Link
Result

A Lagrangian relaxation algorithm for stochastic fixed interval scheduling with non-identical machines and classes

This paper deals with operational fixed interval scheduling problems under uncertainty caused by random delays. This stochastic programming problem has a deterministic reformulation based on network flow under the assumptio...

Statistics and probability

  • 2024
    • •
  • Jimp
    • •
  • Link
Result

A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack

We study the problem of non-preemptively scheduling n jobs, each job j with a release time , a deadline , and a processing time , on m parallel identical machines. Cieliebak et al. (2004) considered the two constraints and and showed the pro...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2017
    • •
  • Jimp
    • •
  • Link
  • 1 - 10 out of 26 475