Resource level minimization in the discrete–continuous scheduling
M Gorczyca, A Janiak - European Journal of Operational Research, 2010 - Elsevier
A discrete–continuous problem of non-preemptive task scheduling on identical parallel
processors is considered. Tasks are described by means of a dynamic model, in which the …
processors is considered. Tasks are described by means of a dynamic model, in which the …
[PDF][PDF] Solving discrete-continuous scheduling problems by Tabu Search
In this paper we consider discrete-continuous scheduling problems defined in [7], where
general results and methodology have been presented as well. These problems are …
general results and methodology have been presented as well. These problems are …
[PDF][PDF] Neighbourhood properties in some single processor scheduling problem with variable efficiency and additional resources
M Gorczyca, A Janiak, W Janiak - Decision Making in …, 2011 - bibliotekanauki.pl
In the paper, we consider a problem of scheduling a set of tasks on a single processor. Each
task must be preprocessed before it can be started on a processor. The efficiency of …
task must be preprocessed before it can be started on a processor. The efficiency of …
A performance analysis of tabu search for discrete-continuous scheduling problems
MGC Resende, JP de Sousa, J Józefowska… - Metaheuristics …, 2004 - Springer
Problems of scheduling jobs on parallel, identical machines under an additional continuous
resource are considered. Jobs are non-preemptable and independent, and all are available …
resource are considered. Jobs are non-preemptable and independent, and all are available …
Discrete-Continuous Scheduling Problem
E Ratajczak-Ropel, A Skakovski… - … -Based Approaches to the …, 2018 - Springer
The discrete-continuous scheduling problem (DCSP) is a particular case of the more
general resource-constrained project scheduling problem (RCPSP). The detailed …
general resource-constrained project scheduling problem (RCPSP). The detailed …