The Community for Technology Leaders
Parallel and Distributed Processing Symposium, International (2008)
Miami, FL, USA
Apr. 14, 2008 to Apr. 18, 2008
ISBN: 978-1-4244-1693-6
pp: 1-7
Adam Janiak , Institute of Computer Engineering, Control and Robotics, Wroc¿aw University of Technology, Janiszewskiego 11/17, 50-372, Poland
Wladyslaw Adam Janiak , Faculty of Computer Science and Management, Wroc¿aw University of Technology, ¿ukasiewicza 5, 50-371, Poland
Marie-Claude Portmann , Ecole des Mines de Nancy, Parc de Saurupt, 54 042 Cedex, France
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.
INDEX TERMS
CITATION
Adam Janiak, Wladyslaw Adam Janiak, Marie-Claude Portmann, "Single machine scheduling with job ready and delivery times subject to resource constraints", Parallel and Distributed Processing Symposium, International, vol. 00, no. , pp. 1-7, 2008, doi:10.1109/IPDPS.2008.4536372
95 ms
(Ver 3.3 (11022016))