Citation
A novel Approximate/Exact objective based search technique for precedence constrained scheduling problems. In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic, pages 484-491, 2015.
Paper
Abstract
In this paper, we propose a novel Approximate/Exact objective based search technique, where a low computational cost approximation of the objective value is used to evaluate examined solutions during searching process. We apply the proposed approach for simulated annealing solving the single machine scheduling problem to minimize the total completion times with ready times, sequence dependent setups and precedence constraints. The numerical analysis reveals the advantages of the novel technique, which overwhelms the typical approach
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{2015-484-491-P, author = {A. Kozik and R. Rudek},
title = {A novel Approximate/Exact objective based search technique for precedence constrained scheduling problems},
booktitle = {In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic},
year = {2015},
editor = {Z. Hanzalek and G. Kendall and B. McCollum and P. Sucha},
pages = {484--491},
note = {Paper},
abstract = { In this paper, we propose a novel Approximate/Exact objective based search technique, where a low computational cost approximation of the objective value is used to evaluate examined solutions during searching process. We apply the proposed approach for simulated annealing solving the single machine scheduling problem to minimize the total completion times with ready times, sequence dependent setups and precedence constraints. The numerical analysis reveals the advantages of the novel technique, which overwhelms the typical approach},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2015-484-491-P.pdf} }