Object
Title: Lower bounds for the scheduling problem with uncertain demands
Contributor:
Korbicz, Józef (1951- ) - red. ; Uciński, Dariusz - red.
Group publication title:
Abstract:
This paper proposes various lower bounds to the makespan of the flexible job shop scheduling problem (FJSP). The FJSP is known in the literature as one of the most difficult combinatorial optimisation problems (NP-hard). We will use genetic algorithms for the optimisation of this type of problems. ; The list of the demands is divided in two sets: the actual demand, which is considered as certain (a list of jobs with known characteristics), and the predicted demand, which is a list of uncertain jobs. The actual demand is scheduled in priority by the genetic algorithm. ; Then, the predicted demand is inserted using various methods in order to generate different scheduling solutions. Two lower bounds are given for the makespan before and after the insertion of the predicted demand. The performance of solutions is evaluated by comparing the real values obtained on many static and dynamic scheduling examples with the corresponding lower bounds.
Publisher:
Zielona Góra: Uniwersytet Zielonogórski
Resource Identifier:
Pages:
Source:
AMCS, volume 16, number 2 (2006) ; click here to follow the link
Language:
Rights:
Biblioteka Uniwersytetu Zielonogórskiego
Object collections:
- Digital Library of Zielona Góra > Repository > Faculties > Faculty of Computer, Electrical and Control Engineering
- Digital Library of Zielona Góra > Repository > Types of work > Articles
- Digital Library of Zielona Góra > Repository > Scientific journals and UZ publishing series > International Journal of Applied Mathematics and Computer Science (AMCS) > International Journal of Applied Mathematics and Computer Science (AMCS) (2006)
Last modified:
Nov 5, 2024
In our library since:
Aug 26, 2020
Number of object content hits:
96
All available object's versions:
https://zbc.uz.zgora.pl/publication/64096
Show description in RDF format:
Show description in OAI-PMH format:
-
International Journal of Applied Mathematics and Computer Science (AMCS)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 26 (2016)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 25 (2015)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 24 (2014)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 23 (2013)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 22 (2012)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 21 (2011)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 20 (2010)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 19 (2009)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 18 (2008)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 17 (2007)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 16 (2006)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 16, number 1 (2006)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 16, number 2 (2006)
- Realization problem for positive multivariable discrete-time linear systems with delays in the state vector and inputs
- An equivalent matrix pencil for bivariate polynomial matrices
- Some properties of the spectral radius of a set of matrices
- A variable structure observer for the control of robot manipulators
- Servo tracking of targets at sea
- Set membership estimation of parameters and variables in dynamic networks by recursive algorithms with a moving measurement window
- Neural network-based MRAC control of dynamic nonlinear systems
- Node assignment problem in Bayesian networks
- A parallel block Lanczos algorithm and its implementation for the evaluation of some eigenvalues of large sparse symmetric matrices on multicomputers
- How to secure a high quality knowledge base in a rule-based system with uncertainty?
- Lower bounds for the scheduling problem with uncertain demands
- Dedicated spectral method of Boolean function decomposition
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 16, number 3 (2006)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 16, number 4 (2006)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 16, number 1 (2006)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 15 (2005)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 13 (2003)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 12 (2002)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 11 (2001)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 10 (2000)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 9 (1999)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 8 (1998)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 7 (1997)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 6 (1996)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 5 (1995)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 4 (1994)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 3 (1993)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 2 (1992)
-
International Journal of Applied Mathematics and Computer Science (AMCS),volume 1 (1991)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 26 (2016)
| Edition name | Date |
|---|---|
| Lower bounds for the scheduling problem with uncertain demands | Nov 5, 2024 |
