Single machine scheduling with job ready and delivery times subject to resource constraints

Abstract : The paper deals with a single machine scheduling problem with job processing times dependent on continuously-divisible resource, e.g. gas, power, energy, raw materials, catalyzer, financial outlay. Ready and delivery times are also given for each job. The problem is to find a schedule of jobs and resource allocation that minimize the time by which all jobs are delivered. Genetic approach, using some proved problem properties is constructed to solve the problem being strongly NP-hard. Analysis of some computational experiment and conclusion remarks are also given.
Type de document :
Communication dans un congrès
IEEE International Symposium on Parallel and Distributed Processing - IPDPS 2008, Apr 2008, Miami, United States. IEEE, pp.1-7, 2008, 〈10.1109/IPDPS.2008.4536372〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00339824
Contributeur : Marie-Claude Portmann <>
Soumis le : mercredi 19 novembre 2008 - 10:06:43
Dernière modification le : mardi 24 avril 2018 - 13:01:59

Identifiants

Collections

Citation

Wladyslaw Adam Janiak, Adam Janiak, Marie-Claude Portmann. Single machine scheduling with job ready and delivery times subject to resource constraints. IEEE International Symposium on Parallel and Distributed Processing - IPDPS 2008, Apr 2008, Miami, United States. IEEE, pp.1-7, 2008, 〈10.1109/IPDPS.2008.4536372〉. 〈inria-00339824〉

Partager

Métriques

Consultations de la notice

118