Adjacent orderings in single‐machine scheduling with earliness and tardiness penalties

Wlodzimierz Szwarc

Naval Research Logistics (NRL), 1993, vol. 40, issue 2, 229-243

Abstract: This article deals with a single‐machine n job earliness‐tardiness model with job‐independent penalties. It demonstrates that the arrangement of adjacent jobs in an optimal schedule depends on a critical value of the start times. Based on these precedence relations, the article develops criteria under which the problem can be decomposed into smaller subproblems. The branching scheme that used the developed results was tested on 70 examples of size n = 10. This scheme should be incorporated in any branch‐and‐bound method once a lower bound is found. The branching scheme can easily handle small problems without a lower bound. © 1993 John Wiley & Sons, Inc.

Date: 1993
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(199303)40:23.0.CO;2-R

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:2:p:229-243

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