Professor
Supervisor of Doctorate Candidates
Supervisor of Master's Candidates
The Last Update Time: ..
Minimizing Makespan on A Single Batch Machine with Release Times and Non-identical Job Sizes
Affiliation of Author(s):山东大学数学学院
Journal:Operations Research Letters
Abstract:We consider the problem of scheduling jobs with release times and non-identical job sizes on a single batching machine; our objective is to minimize makespan. We present an approximation algorithm with worst-case ratio 2+@e, where @e>0 can be made arbitrarily small.
First Author:Li, S.
Indexed by:Journal paper
Correspondence Author:Li, G.
Discipline:Natural Science
First-Level Discipline:Mathematics
Document Type:J
Volume:33
Issue:2
Page Number:157-164
Translation or Not:no
Date of Publication:2005-03-01
Included Journals:SCI