Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Simultaneous Resource Scheduling to Minimize Weighted Flow Times

Simultaneous Resource Scheduling to Minimize Weighted Flow Times Many scheduling problems in manufacturing and service firms involve tasks that require more than one resource to be used simultaneously to execute the task. Two formulations of this scheduling problem are given. We develop a Lagrangian relaxation for the problem that has an intuitive interpretation. The relaxation suggests heuristics and provides a lower bound on the optimal solution. Next a surrogate relaxation is developed that provides a second bound and a heuristic solution. An enumeration procedure to determine the optimal solution is described, and computational results on the effectiveness of the bounds and the heuristics are presented. The Lagrangian relaxation performs better on problems with a low degree of simultaneity, and the surrogate relaxation does better with a high degree of simultaneity. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Operations Research INFORMS

Simultaneous Resource Scheduling to Minimize Weighted Flow Times

Operations Research , Volume 37 (4): 9 – Aug 1, 1989
9 pages

Loading next page...
 
/lp/informs/simultaneous-resource-scheduling-to-minimize-weighted-flow-times-SUljceeE0L

References (11)

Publisher
INFORMS
Copyright
Copyright © INFORMS
Subject
Research Article
ISSN
0030-364X
eISSN
1526-5463
DOI
10.1287/opre.37.4.592
Publisher site
See Article on Publisher Site

Abstract

Many scheduling problems in manufacturing and service firms involve tasks that require more than one resource to be used simultaneously to execute the task. Two formulations of this scheduling problem are given. We develop a Lagrangian relaxation for the problem that has an intuitive interpretation. The relaxation suggests heuristics and provides a lower bound on the optimal solution. Next a surrogate relaxation is developed that provides a second bound and a heuristic solution. An enumeration procedure to determine the optimal solution is described, and computational results on the effectiveness of the bounds and the heuristics are presented. The Lagrangian relaxation performs better on problems with a low degree of simultaneity, and the surrogate relaxation does better with a high degree of simultaneity.

Journal

Operations ResearchINFORMS

Published: Aug 1, 1989

Keywords: Keywords : production/scheduling, sequencing, deterministic, multimachine: simultaneous resource scheduling ; programming, integer, heuristic: simultaneous resource scheduling

There are no references for this article.