Scheduling unit-length jobs with machine eligibility restrictions

Research output: Journal article publicationJournal articleAcademic researchpeer-review

25 Citations (Scopus)

Abstract

We consider uniform parallel machine scheduling problems with unit-length jobs where every job is only allowed to be processed on a specified subset of machines. We develop efficient methods to solve problems with various objectives, including minimizing a total tardiness function, a maximum tardiness function, total completion time, the number of tardy jobs, the makespan, etc.
Original languageEnglish
Pages (from-to)1325-1328
Number of pages4
JournalEuropean Journal of Operational Research
Volume174
Issue number2
DOIs
Publication statusPublished - 16 Oct 2006

Keywords

  • Machine eligibility restrictions
  • Scheduling
  • Uniform machines
  • Unit-length jobs

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Applied Mathematics
  • Modelling and Simulation
  • Transportation

Cite this