Single machine scheduling with job ready and delivery times subject to resource constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

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

Wladyslaw Adam Janiak
  • Function : Author
Adam Janiak
  • Function : Author

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.
No file

Dates and versions

inria-00339824 , version 1 (19-11-2008)

Identifiers

Cite

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, IEEE, Apr 2008, Miami, United States. pp.1-7, ⟨10.1109/IPDPS.2008.4536372⟩. ⟨inria-00339824⟩
64 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More