Citation
A computational study of shifting bottleneck procedures for job shop total weighted tardiness scheduling problems. In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium, pages 437-457, 2013.
Paper
Abstract
Minimizing total weighted tardiness for job shops is a hard production scheduling problem. The shifting bottleneck (SB) procedure is considered to be one of the most effective heuristics to solve this problem. However, as a divide-and-conquer heuristic, the SB procedure consists of independently implementable components and for each of these components there are various solutions. The way to configure its components has a significant effect on the performance (i.e., scheduling quality) and efficiency (i.e., scheduling time) of the SB procedure. Aim of this paper is to give a guideline on appropriate configurations of the SB components. We review the component solutions in the literature and suggest improvements to some of them. Afterwards, we examine the performance as well as efficiency of the component solutions of the SB procedure by computational experiments. The experiments were conducted on static benchmark problem instances from the literature as well as on dynamic problem instances generated by dynamic job shop simulations. With the experiment results, we identify the effects of the different component solutions on the performance and efficiency of the SB procedure and suggest appropriate configurations regarding different problem sizes and scheduling time requirements.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2013-437-457-P, author = {B. Scholz-Reiter and Y. Tan and T. Hildebrandt },
title = {A computational study of shifting bottleneck procedures for job shop total weighted tardiness scheduling problems},
booktitle = {In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium},
year = {2013},
editor = {G. Kendall and B. McCollum and G. {Venden Berghe}},
pages = {437--457},
note = {Paper},
abstract = { Minimizing total weighted tardiness for job shops is a hard production scheduling problem. The shifting bottleneck (SB) procedure is considered to be one of the most effective heuristics to solve this problem. However, as a divide-and-conquer heuristic, the SB procedure consists of independently implementable components and for each of these components there are various solutions. The way to configure its components has a significant effect on the performance (i.e., scheduling quality) and efficiency (i.e., scheduling time) of the SB procedure. Aim of this paper is to give a guideline on appropriate configurations of the SB components. We review the component solutions in the literature and suggest improvements to some of them. Afterwards, we examine the performance as well as efficiency of the component solutions of the SB procedure by computational experiments. The experiments were conducted on static benchmark problem instances from the literature as well as on dynamic problem instances generated by dynamic job shop simulations. With the experiment results, we identify the effects of the different component solutions on the performance and efficiency of the SB procedure and suggest appropriate configurations regarding different problem sizes and scheduling time requirements. },
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2013-437-457-P.pdf} }