publication . Article . 2007

Selection and scheduling of jobs with time-dependent duration

DM Seegmuller; SE Visagie; HC de Kock; WJ Pienaar;
Open Access
  • Published: 01 Jun 2007 Journal: ORiON, volume 23 (eissn: 2224-0004, Copyright policy)
  • Publisher: Stellenbosch University
Abstract
In this paper two mathematical programming models, both with multiple objective functions, are proposed to solve four related categories of job scheduling problems. All four of these categories have the property that the duration of the jobs is dependent on the time of implementation and in some cases the preceding job. Furthermore, some jobs (restricted to subsets of the total pool of jobs) can, to different extents, run in parallel. In addition, not all the jobs need necessarily be implemented during the given time period.
Subjects
ACM Computing Classification System: ComputingMilieux_THECOMPUTINGPROFESSION
free text keywords: Operations management, Mathematical optimization, Highest response ratio next, Job scheduler, computer.software_genre, computer, Scheduling (computing), Job queue, Integer programming, Computer science, Scheduling (production processes), General Works, A
Related Organizations
Download fromView all 2 versions
ORiON
Article . 2007
Provider: Crossref
ORiON
Article
Provider: UnpayWall
ORiON
Article . 2007
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Article . 2007

Selection and scheduling of jobs with time-dependent duration

DM Seegmuller; SE Visagie; HC de Kock; WJ Pienaar;