A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop

Michael Pinedo and Marcos Singer ()

Naval Research Logistics (NRL), 1999, vol. 46, issue 1, 1-17

Abstract: We present a shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. The method decomposes the job shop into a number of single‐machine subproblems that are solved one after another. Each machine is scheduled according to the solution of its corresponding subproblem. The order in which the single machine subproblems are solved has a significant impact on the quality of the overall solution and on the time required to obtain this solution. We therefore test a number of different orders for solving the subproblems. Computational results on 66 instances with ten jobs and ten machines show that our heuristic yields solutions that are close to optimal, and it clearly outperforms a well‐known dispatching rule enhanced with backtracking mechanisms. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 1–17, 1999

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

Downloads: (external link)
https://doi.org/10.1002/(SICI)1520-6750(199902)46:13.0.CO;2-#

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:46:y:1999:i:1:p:1-17

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