A minimum-cost network flow approach to preemptive parallel-machine scheduling

Ling Huey Su, Edwin Tai Chiu Cheng, Fuh Der Chou

Research output: Journal article publicationJournal articleAcademic researchpeer-review

6 Citations (Scopus)


We model and solve the problems of preemptive scheduling of n independent jobs with release dates on m parallel machines with machine availability and eligibility constraints to minimize the makespan and maximum lateness as the minimum-cost network flow problem. We show that the approach can be extended to solve the corresponding scheduling problems on two uniform parallel machines.
Original languageEnglish
Pages (from-to)453-458
Number of pages6
JournalComputers and Industrial Engineering
Issue number1
Publication statusPublished - 1 Jan 2013


  • Minimum-cost network flow
  • Parallel machines
  • Preemptive jobs
  • Scheduling
  • Uniform machines

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)


Dive into the research topics of 'A minimum-cost network flow approach to preemptive parallel-machine scheduling'. Together they form a unique fingerprint.

Cite this