Bicriterion scheduling with equal processing times on a batch processing machine

Research output: Journal article publicationJournal articleAcademic researchpeer-review

17 Citations (Scopus)


In this paper we consider the problem of scheduling jobs with equal processing times on a single batch processing machine so as to minimize a primary and a secondary criteria. We provide optimal polynomial time algorithms for various combinations of the primary and secondary criteria.
Original languageEnglish
Pages (from-to)110-118
Number of pages9
JournalComputers and Operations Research
Issue number1
Publication statusPublished - 1 Jan 2009


  • Batch processing machine
  • Bicriterion
  • Scheduling

ASJC Scopus subject areas

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

Cite this