Citation
The single-machine scheduling problem with a finite capacity input buffer. In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium, pages 171-184, 2013.
Paper
Abstract
This study treats the single-machine scheduling problem with a ?nite capacity input buffer. In this problem, each job is assigned to the machine at its release date and startedimmediately,or,is sent to the input buffer to wait for processing.The problem in this study is to ?nd a schedule that minimizes the required size of the input buffer. Its strong NP hardness will be shown ?rst and next, an integer programming formulation will be presented. Another integer programming formulation will also be derived for the special case when the sizes of the jobs are the same. Then, a simple heuristic algorithm will be proposed. Finally, the effectiveness of the formulations and the heuristic algorithm will be examined by numerical experiments.
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-171-184-P, author = {S. Tanaka},
title = {The single-machine scheduling problem with a finite capacity input buffer},
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 = {171--184},
note = {Paper},
abstract = { This study treats the single-machine scheduling problem with a ?nite capacity input buffer. In this problem, each job is assigned to the machine at its release date and startedimmediately,or,is sent to the input buffer to wait for processing.The problem in this study is to ?nd a schedule that minimizes the required size of the input buffer. Its strong NP hardness will be shown ?rst and next, an integer programming formulation will be presented. Another integer programming formulation will also be derived for the special case when the sizes of the jobs are the same. Then, a simple heuristic algorithm will be proposed. Finally, the effectiveness of the formulations and the heuristic algorithm will be examined by numerical experiments.},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2013-171-184-P.pdf} }