Filters
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
Rok uplatnění
D - Stať ve sborníku
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
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
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
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
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
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
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
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
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
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
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
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
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
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
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
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
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
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
- 1 - 10 out of 26 475