Lagrangian relaxation method for single machine scheduling with a common delivery window

Michael X. Weng, Jose Antonio Ventura

Research output: Contribution to conferencePaper

Abstract

In this paper we consider the single machine scheduling problem of minimizing the mean absolute deviation (MAD) of job completion times from a restricted common delivery window. This problem is NP-hard. A Lagrangian relaxation procedure is proposed to solve the problem. Two efficient heuristics are also proposed. An experimental study on randomly generated problems is carried out to test the performance of the proposed methods. The computational results show that the obtained lower bounds are very good and the proposed heuristics generate near-optimal solutions.

Original languageEnglish (US)
Pages103-108
Number of pages6
StatePublished - Dec 1 1996
EventProceedings of the 1996 5th Industrial Engineering Research Conference - Minneapolis, MN, USA
Duration: May 18 1996May 20 1996

Other

OtherProceedings of the 1996 5th Industrial Engineering Research Conference
CityMinneapolis, MN, USA
Period5/18/965/20/96

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Lagrangian relaxation method for single machine scheduling with a common delivery window'. Together they form a unique fingerprint.

Cite this