A survey of algorithms for single and multi-objective unrelated parallel-machine deterministic scheduling problems

Michele Pfund, John Fowler, Jatinder N D Gupta

Research output: Contribution to journalArticle

59 Scopus citations


This paper surveys the literature related to solving traditional unrelated parallel-machine scheduling problems. It compiles algorithms for the makespan, total weighted sum of completion times, maximum tardiness, total tardiness, total earliness and tardiness, and multiple criteria performance measures. The review of the existing algorithms is restricted to the deterministic problems without setups, preemptions, or side conditions on the problem. Even for such traditional problems, this survey reveals that while makespan minimization has been fairly widely studied, problems that include processing characteristics such as release times, sequence dependent setups, and preemptions remain largely unstudied. Research in solving unrelated parallel-machine scheduling problems involving the minimization of the number of tardy jobs, weighted number of tardy jobs, total tardiness, and total weighted tardiness is quite limited.

Original languageEnglish (US)
Pages (from-to)230-241
Number of pages12
JournalJournal of the Chinese Institute of Industrial Engineers
Issue number3
StatePublished - Jan 1 2004



  • Multi-objective scheduling
  • Parallel machines
  • Scheduling

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this