IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v40y1993i3p325-344.html
   My bibliography  Save this article

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

Author

Listed:
  • Ishwar Murthy

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.

Suggested Citation

  • Ishwar Murthy, 1993. "Solving the multiperiod assignment problem with start‐up costs using dual ascent," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(3), pages 325-344, April.
    • Handle: RePEc:wly:navres:v:40:y:1993:i:3:p:325-344
    DOI: 10.1002/1520-6750(199304)40:33.0.CO;2-W
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199304)40:33.0.CO;2-W
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199304)40:33.0.CO;2-W?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Ming S. Hung & Walter O. Rom, 1980. "Solving the Assignment Problem by Relaxation," Operations Research, INFORMS, vol. 28(4), pages 969-982, August.
    2. Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
    3. Uday S. Karmarkar & Sham Kekre & Sunder Kekre, 1987. "The Dynamic Lot-Sizing Problem with Startup and Reservation Costs," Operations Research, INFORMS, vol. 35(3), pages 389-398, June.
    4. T. C. Hu & Y. S. Kuo & F. Ruskey, 1987. "Some Optimum Algorithms for Scheduling Problems with Changeover Costs," Operations Research, INFORMS, vol. 35(1), pages 94-99, February.
    5. Donald Erlenkotter, 1978. "A Dual-Based Procedure for Uncapacitated Facility Location," Operations Research, INFORMS, vol. 26(6), pages 992-1009, December.
    6. Aronson, Jay E., 1986. "The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm," European Journal of Operational Research, Elsevier, vol. 23(3), pages 367-381, March.
    7. Burkard, Rainer E., 1984. "Quadratic assignment problems," European Journal of Operational Research, Elsevier, vol. 15(3), pages 283-289, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Reza Farahani & Zvi Drezner & Nasrin Asgari, 2009. "Single facility location and relocation problem with time dependent weights and discrete planning horizon," Annals of Operations Research, Springer, vol. 167(1), pages 353-368, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
    2. Cattrysse, D. G. & van Wassenhove, L. N., 1990. "A Survey Of Algorithms For The Generalized Assignment Problem," Econometric Institute Archives 272389, Erasmus University Rotterdam.
    3. Monique Guignard, 2007. "En hommage à Joseph-Louis Lagrange et à Pierre Huard," Annals of Operations Research, Springer, vol. 149(1), pages 103-116, February.
    4. Hinojosa, Y. & Puerto, J. & Fernandez, F. R., 2000. "A multiperiod two-echelon multicommodity capacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 123(2), pages 271-291, June.
    5. Rajagopalan, S. & Yu, Hung-Liang, 2001. "Capacity planning with congestion effects," European Journal of Operational Research, Elsevier, vol. 134(2), pages 365-377, October.
    6. Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    7. Li, Gang & Balakrishnan, Anantaram, 2016. "Models and algorithms for network reduction," European Journal of Operational Research, Elsevier, vol. 248(3), pages 930-942.
    8. Lian Qi & Zuo-Jun Max Shen & Lawrence V. Snyder, 2010. "The Effect of Supply Disruptions on Supply Chain Design Decisions," Transportation Science, INFORMS, vol. 44(2), pages 274-289, May.
    9. Torbjörn Larsson & Michael Patriksson, 2006. "Global Optimality Conditions for Discrete and Nonconvex Optimization---With Applications to Lagrangian Heuristics and Column Generation," Operations Research, INFORMS, vol. 54(3), pages 436-453, June.
    10. Dupont, Lionel, 2008. "Branch and bound algorithm for a facility location problem with concave site dependent costs," International Journal of Production Economics, Elsevier, vol. 112(1), pages 245-254, March.
    11. P N Ram Kumar & T T Narendran, 2011. "On the usage of Lagrangean Relaxation for the convoy movement problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 722-728, April.
    12. Cruz, F. R. B. & Smith, J. MacGregor & Mateus, G. R., 1999. "Algorithms for a multi-level network optimization problem," European Journal of Operational Research, Elsevier, vol. 118(1), pages 164-180, October.
    13. Canovas, Lazaro & Garcia, Sergio & Marin, Alfredo, 2007. "Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique," European Journal of Operational Research, Elsevier, vol. 179(3), pages 990-1007, June.
    14. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
    15. M Diaby & A L Nsakanda, 2006. "Large-scale capacitated part-routing in the presence of process and routing flexibilities and setup costs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(9), pages 1100-1112, September.
    16. Ogbe, Emmanuel & Li, Xiang, 2017. "A new cross decomposition method for stochastic mixed-integer linear programming," European Journal of Operational Research, Elsevier, vol. 256(2), pages 487-499.
    17. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
    18. Syam, Siddhartha S. & Côté, Murray J., 2010. "A location-allocation model for service providers with application to not-for-profit health care organizations," Omega, Elsevier, vol. 38(3-4), pages 157-166, June.
    19. Weijun Xie & Yanfeng Ouyang & Sze Chun Wong, 2016. "Reliable Location-Routing Design Under Probabilistic Facility Disruptions," Transportation Science, INFORMS, vol. 50(3), pages 1128-1138, August.
    20. Shangyao Yan & Chun-Ying Chen & Chuan-Che Wu, 2012. "Solution methods for the taxi pooling problem," Transportation, Springer, vol. 39(3), pages 723-748, May.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:40:y:1993:i:3:p:325-344. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.