J
Ji-Bo Wang
Researcher at Shenyang Aerospace University
Publications - 111
Citations - 3148
Ji-Bo Wang is an academic researcher from Shenyang Aerospace University. The author has contributed to research in topics: Job shop scheduling & Single-machine scheduling. The author has an hindex of 32, co-authored 111 publications receiving 2879 citations. Previous affiliations of Ji-Bo Wang include Xi'an Jiaotong University & Hong Kong Polytechnic University.
Papers
More filters
Journal ArticleDOI
Single-machine scheduling with a time-dependent learning effect
TL;DR: In this article, the authors consider the single-machine scheduling problem with a time-dependent learning effect, where the learning effect of a job is assumed to be a function of the total normal processing time of the jobs scheduled in front of the job.
Journal ArticleDOI
Single-machine scheduling with past-sequence-dependent setup times and time-dependent learning effect
TL;DR: It is shown that the makespan minimizationproblem, the total completion time minimization problem and the sum of the quadratic job completion times minimization problems can be solved in polynomial time, respectively.
Journal ArticleDOI
Single-machine due-window assignment problem with learning effect and deteriorating jobs
Ji-Bo Wang,Cheng Wang +1 more
TL;DR: In this article, the authors considered a single-machine common due-window assignment scheduling problem with learning effect and deteriorating jobs and showed that the problem remains polynomially solvable under the proposed model.
Journal ArticleDOI
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
TL;DR: This paper considers single-machine scheduling problems with deteriorating jobs, i.e., jobs whose processing times are an increasing function of their starting times, and shows that for the general linear problem to minimize the makespan, polynomial algorithms exist.
Journal ArticleDOI
Minimizing total completion time in a two-machine flow shop with deteriorating jobs
TL;DR: A heuristic algorithm is proposed to overcome the inefficiency of the branch-and-bound algorithm and to find a sequence that minimizes total completion time in a two-machine flow shop scheduling problem with deteriorating jobs.