Weighted Tardiness Single Machine Scheduling with Proportional Weights

Wlodzimierz Szwarc and John J. Liu
Additional contact information
Wlodzimierz Szwarc: School of Business Administration, University of Wisconsin-Milwaukee, Milwaukee, Wisconsin 53201
John J. Liu: School of Business Administration, University of Wisconsin-Milwaukee, Milwaukee, Wisconsin 53201

Management Science, 1993, vol. 39, issue 5, 626-632

Abstract: This paper considers Arkin and Roundy's single machine weighted tardiness scheduling model with tardiness penalties proportional to the processing times. It presents a two-stage decomposition mechanism that proves to be powerful in solving the problem completely or reducing it to a much smaller problem. Three types of orderings of adjacent jobs are derived that play a crucial role in problem decomposition. The decomposition method solves 155 out of 320 test problems with job sizes ranging from 20 to 150. It reduces 163 unsolved problems to smaller subproblems with sizes not exceeding 25 jobs. The job sizes of the remaining two unsolved subproblems are 30 and 45.

Keywords: scheduling problem; precedence relation; proportional weights (search for similar items in EconPapers)
Date: 1993
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.39.5.626 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:39:y:1993:i:5:p:626-632

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().