Sciweavers

301 search results - page 2 / 61
» Job Sequencing with Exponential Functions of Processing Time...
Sort
View
PE
2006
Springer
125views Optimization» more  PE 2006»
14 years 9 months ago
Approximating multi-skill blocking systems by HyperExponential Decomposition
We consider multi-class blocking systems in which jobs require a single processing step. There are groups of servers that can each serve a different subset of all job classes. The...
Geert Jan Franx, Ger Koole, Auke Pot
CPAIOR
2004
Springer
15 years 2 months ago
A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
Christian Artigues, Sana Belmokhtar, Dominique Fei...
EUSFLAT
2003
14 years 10 months ago
Minimisation of the expected weighted number of jobs being late with fuzzy processing time in a one machine system
One machine scheduling problem with fuzzy processing times and a penalty for each job being late (the penalty is independent of the magnitude of the lateness) is considered. The o...
Barbara Gladysz, Dorota Kuchta
GRID
2008
Springer
14 years 9 months ago
Statistical Analysis and Modeling of Jobs in a Grid Environment
The existence of good probabilistic models for the job arrival process and the delay components introduced at different stages of job processing in a Grid environment is important ...
Kostas Christodoulopoulos, Vasileios Gkamas, Emman...
DISOPT
2008
89views more  DISOPT 2008»
14 years 9 months ago
Group sequencing around a common due date
The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...
T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, ...