inria-00339824, version 1
Single machine scheduling with job ready and delivery times subject to resource constraints
IEEE International Symposium on Parallel and Distributed Processing - IPDPS 2008 (2008) 1-7
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.
- a – Wroclaw University of Technology
- b – Institut National Polytechnique de Lorraine
- 1:
- Université de Lorraine – CNRS : UMR7503 – Institut National Polytechnique de Lorraine (INPL)
- Domain : Mathematics/Combinatorics
- Keywords : scheduling – single machine – continuously divisible resource
- inria-00339824, version 1
- http://hal.inria.fr/inria-00339824
- oai:hal.inria.fr:inria-00339824
- From:
- Submitted on: Wednesday, 19 November 2008 10:06:43
- Updated on: Monday, 8 December 2008 14:23:29
Associated documents
Export