Minimizing the number of tardy jobs with controllable processing times

Liron Yedidsion, Moshe Kaspi

Research output: Contribution to conferencePaperpeer-review

Abstract

This research basically extends the boundaries of the minimization of the number of tardy jobs (NT) problem to where processing times are controllable by allocating a common, continuous, and nonrenewable resource. Most of the research on scheduling with controllable resource-dependent processing times assumed either a linear resource consumption function, that does not obey the law of diminishing returns or a specific convex consumption function, that applies only to a limited number of problems. We, on the other hand, assume a general consumption function, which guarantees a very robust solution that can be applied for a very wide range of problems and is appropriate for real life situations. We established the computational complexity for the NT problem with controllable resource dependent processing times, proving it to be NP-hard. We present a polynomial algorithm to solve a special case of that problem, where all jobs are identical. We also suggest and compare four different heuristic algorithms to solve this problem.

Original languageEnglish
StatePublished - 1 Dec 2006
Event2006 IIE Annual Conference and Exposition - Orlando, FL, United States
Duration: 20 May 200624 May 2006

Conference

Conference2006 IIE Annual Conference and Exposition
Country/TerritoryUnited States
CityOrlando, FL
Period20/05/0624/05/06

Keywords

  • Controllable processing times
  • N problem
  • NP-hard
  • Resource allocation
  • Scheduling

Fingerprint

Dive into the research topics of 'Minimizing the number of tardy jobs with controllable processing times'. Together they form a unique fingerprint.

Cite this