Parallel-machine scheduling with controllable processing times

Research output: Journal article publicationJournal articleAcademic researchpeer-review

38 Citations (Scopus)

Abstract

We consider a problem of scheduling nindependent and simultaneously available jobs on munrelated parallel machines. The job processing times can be compressed through incurring an additional cost, which is a convex function of the amount of compression. Two problems are formulated as assignment problems, which can be solved inO (n3m + n2m log(nm))time. One is to minimize the total compression cost plus the total flow time. The other is to minimize the total compression cost plus the sum of earliness and tardiness costs.
Original languageEnglish
Pages (from-to)177-180
Number of pages4
JournalIIE Transactions (Institute of Industrial Engineers)
Volume28
Issue number2
DOIs
Publication statusPublished - 1 Jan 1996

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this