Citation
Cyclic job shop scheduling problems with blocking. Annals of Operations Research, 159 (1): 161-181, 2008.
Selected
Abstract
A tabu search algorithm for a cyclic job shop problem with blocking is presented. Operations are blocking if theymust stay on a machine after finishing when the nextmachine is occupied by another job. During this stay the machine is blocked for other jobs. For this problem traditional tabu search moves often lead to infeasible solutions. Recovering procedures are developed which construct nearby feasible solutions. Computational results are presented for the approach.
There is no pdf available for this paper. You might like to try to obtain the original source (see the doi, for example)
doi
The doi for this publication is 10.1007/s10479-007-0276-z You can link directly to the original paper, via the doi, from here
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
@ARTICLE{2008-161-181-SI, author = {P. Brucker and T. Kampmeyer},
title = {Cyclic job shop scheduling problems with blocking},
journal = {Annals of Operations Research},
year = {2008},
volume = {159},
pages = {161--181},
number = {1},
note = {Selected},
abstract = {A tabu search algorithm for a cyclic job shop problem with blocking is presented. Operations are blocking if theymust stay on a machine after finishing when the nextmachine is occupied by another job. During this stay the machine is blocked for other jobs. For this problem traditional tabu search moves often lead to infeasible solutions. Recovering procedures are developed which construct nearby feasible solutions. Computational results are presented for the approach.},
doi = {10.1007/s10479-007-0276-z},
owner = {user},
timestamp = {2012.05.25} }