A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time

Volume: 286, Issue: 2, Pages: 432 - 443
Published: Oct 1, 2020
Abstract
In this paper, we present a column generation based decomposition method for the parallel batch scheduling of jobs on identical parallel machines. Jobs have different release dates, processing times and sizes while machines have limited capacity. The objective is the minimization of total flow time, i.e., sum of completion times of all processed jobs. The straightforward mixed integer linear programming model of the problem is efficient for...
Paper Details
Title
A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time
Published Date
Oct 1, 2020
Volume
286
Issue
2
Pages
432 - 443
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.