Single‐machine scheduling to minimize absolute deviation of completion times from a common due date

Wlodzimierz Szwarc

Naval Research Logistics (NRL), 1989, vol. 36, issue 5, 663-673

Abstract: The article considers a single‐machine n‐job scheduling problem to minimize the sum of absolute lateness given a common due date. Two models are defined depending on whether the start time t0 of schedules is arbitrary or fixed. Conditions are provided when those two models coincide. The developed branch‐and‐bound procedure is tested on nine known examples from the literature (6 ⩽ n ⩽ 14) and 90 medium‐size random problems (15 ⩽ n ⩽ 25) with a fixed t0.

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

Downloads: (external link)
https://doi.org/10.1002/1520-6750(198910)36:53.0.CO;2-X

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:36:y:1989:i:5:p:663-673

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 ().