Solving the multiperiod assignment problem with start‐up costs using dual ascent

Ishwar Murthy

Naval Research Logistics (NRL), 1993, vol. 40, issue 3, 325-344

Abstract: In this article we consider a multiperiod assignment problem where the assignment cost of assigning job i to machine j varies from one time period to the next. A start‐up cost is incurred whenever the job processed by a machine in the current time period is different from the one processed in the previous time period. This problem is modeled as an integer programming problem for which a dual ascent approximate procedure is developed. Our computational results show that our procedure outperforms the more common Lagrangian‐relaxation‐based subgradient procedure by a significant margin. It is also found to be faster than MPSX/370 by many orders of magnitude. © 1993 John Wiley & Sons, Inc.

Date: 1993
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199304)40:33.0.CO;2-W

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:wly:navres:v:40:y:1993:i:3:p:325-344

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().