M
Michael X. Weng
Researcher at University of South Florida
Publications - 5
Citations - 226
Michael X. Weng is an academic researcher from University of South Florida. The author has contributed to research in topics: Scheduling (computing) & Heuristic (computer science). The author has an hindex of 5, co-authored 5 publications receiving 217 citations.
Papers
More filters
Journal ArticleDOI
Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective
TL;DR: This paper addresses the problem of scheduling a set of independent jobs on unrelated parallel machines with job sequence dependent setup times so as to minimize a weighted mean completion time, and proposes seven heuristic algorithms for solving this problem.
Journal ArticleDOI
Minimizing single-machine completion time variance
José A. Ventura,Michael X. Weng +1 more
TL;DR: A Lagrangian relaxation LR procedure is developed to find a lower bound LB to the optimal objective value of n-job, single-machine scheduling, and it is shown that the lower bounds obtained by the LR procedure are very close to the best known objective values.
Journal ArticleDOI
A note on “common due window scheduling”
Michael X. Weng,José A. Ventura +1 more
TL;DR: It is shown that the problem is polynomial if the window location is unrestricted, and a more efficient dynamic program algorithm is presented to optimally solve the problem if thewindow location is restricted.
Journal ArticleDOI
Single Machine Scheduling with a Common Delivery Window
José A. Ventura,Michael X. Weng +1 more
TL;DR: This paper considers the single machine scheduling problem of minimizing the mean absolute deviation of job completion times from a restricted common delivery window and proposes two efficient heuristics that generate near-optimal solutions.
Journal ArticleDOI
Single-machine earliness-tardiness scheduling about a common due date with tolerances
Michael X. Weng,José A. Ventura +1 more
TL;DR: In this article, the problem of minimizing the mean absolute deviation (MAD) of job completion times about a given common due date with different sizes of tolerance in an n -job, single-machine scheduling environment is considered.