Resource leveling in a machine environment

Márton Drótos, Tamás Kis

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

We address resource leveling problems in a machine environment. Given a set of m machines, one or more renewable resources, and a set of n tasks, each assigned to exactly one of the machines. Each task has a processing time, an earliest start time, a deadline, and resource requirements. There are no precedence relations between the tasks. The tasks have to be sequenced on the machines while minimizing a function of the level of resource utilization from each resource over time. We provide various complexity results including a polynomial time algorithm for a one machine special case. We also propose an exact method using various techniques to find optimal or close-to-optimal solutions. The computational experiments show that our exact method significantly outperforms heuristics and a commercial MIP solver.

Original languageEnglish
Pages (from-to)12-21
Number of pages10
JournalEuropean Journal of Operational Research
Volume212
Issue number1
DOIs
Publication statusPublished - Jul 1 2011

    Fingerprint

Keywords

  • Branch and bound
  • Parallel machines
  • Resource leveling
  • Scheduling

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this