P
Paul A. Rubin
Researcher at Michigan State University
Publications - 34
Citations - 1006
Paul A. Rubin is an academic researcher from Michigan State University. The author has contributed to research in topics: Linear programming & Heuristics. The author has an hindex of 17, co-authored 33 publications receiving 967 citations. Previous affiliations of Paul A. Rubin include Colorado Mesa University & Saint Petersburg State University.
Papers
More filters
Journal ArticleDOI
Scheduling in a sequence dependent setup environment with genetic search
Paul A. Rubin,Gary L. Ragatz +1 more
TL;DR: This work examines the efficacy of using genetic search to develop near optimal schedules in a single-stage process where setup times are sequence dependent.
Journal ArticleDOI
Fuzzy goal programming with nested priorities
Paul A. Rubin,Ram Narasimhan +1 more
TL;DR: In this paper, the authors proposed a new approach to formulating fuzzy priorities in a goal programming problem, which leads to a formulation in which tradeoffs between goals more closely reflect the decision maker's intentions than in other noninteractive approaches.
Journal ArticleDOI
A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times
TL;DR: The experimental results suggest that simulated annealing and random-start pairwise interchange are viable solution techniques that can yield good solutions to a large combinatorial problem when considering the tardiness objective with sequence dependent setup times.
Journal ArticleDOI
Incentive payment and nonmanagerial productivity: An interrupted time series analysis of magnitude and trend
TL;DR: In this article, the authors examined long-term changes in the magnitude and trend of productivity following the introduction of non-managerial incentive payment in a unionized iron foundry.
Journal ArticleDOI
Combinatorial Benders Cuts for the Minimum Tollbooth Problem
Lihui Bai,Paul A. Rubin +1 more
TL;DR: Computational study of real networks as well as randomly generated networks indicates that the proposed solution method is efficient in obtaining provably optimal solutions for networks with small to medium sizes.