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

Fingerprint

Computational complexity
Scheduling

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Cite this

Weng, M. X., & Ventura, J. A. (1996). Lagrangian relaxation method for single machine scheduling with a common delivery window. 103-108. Paper presented at Proceedings of the 1996 5th Industrial Engineering Research Conference, Minneapolis, MN, USA, .
Weng, Michael X. ; Ventura, Jose Antonio. / Lagrangian relaxation method for single machine scheduling with a common delivery window. Paper presented at Proceedings of the 1996 5th Industrial Engineering Research Conference, Minneapolis, MN, USA, .6 p.
@conference{d4dc4c09d7414bb787d9490356153dba,
title = "Lagrangian relaxation method for single machine scheduling with a common delivery window",
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.",
author = "Weng, {Michael X.} and Ventura, {Jose Antonio}",
year = "1996",
month = "12",
day = "1",
language = "English (US)",
pages = "103--108",
note = "Proceedings of the 1996 5th Industrial Engineering Research Conference ; Conference date: 18-05-1996 Through 20-05-1996",

}

Weng, MX & Ventura, JA 1996, 'Lagrangian relaxation method for single machine scheduling with a common delivery window', Paper presented at Proceedings of the 1996 5th Industrial Engineering Research Conference, Minneapolis, MN, USA, 5/18/96 - 5/20/96 pp. 103-108.

Lagrangian relaxation method for single machine scheduling with a common delivery window. / Weng, Michael X.; Ventura, Jose Antonio.

1996. 103-108 Paper presented at Proceedings of the 1996 5th Industrial Engineering Research Conference, Minneapolis, MN, USA, .

Research output: Contribution to conferencePaper

TY - CONF

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

AU - Weng, Michael X.

AU - Ventura, Jose Antonio

PY - 1996/12/1

Y1 - 1996/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0030364104&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030364104&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0030364104

SP - 103

EP - 108

ER -

Weng MX, Ventura JA. Lagrangian relaxation method for single machine scheduling with a common delivery window. 1996. Paper presented at Proceedings of the 1996 5th Industrial Engineering Research Conference, Minneapolis, MN, USA, .