Scheduling tasks with sequence‐dependent processing times

Lucio Bianco, Salvatore Ricciardelli, Giovanni Rinaldi and Antonio Sassano

Naval Research Logistics (NRL), 1988, vol. 35, issue 2, 177-184

Abstract: In this article we consider the problem of minimizing the maximum completion time of a sequence of n jobs on a single machine. Nonzero ready times and sequence‐dependent processing times are allowed. Upper bounds, lower bounds, and dominance criteria are proposed and exploited in a branch‐and‐bound algorithm. Computational results are given.

Date: 1988
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(198804)35:23.0.CO;2-V

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:35:y:1988:i:2:p:177-184

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