Document Zbl 1009.90054

<!doctype html> <html lang="en"> <head> <meta charset="utf-8"> <title>Document Zbl 1009.90054 - zbMATH Open</title> <meta name="viewport" content="width=device-width, minimum-scale=0.1, maximum-scale=5.0"> <meta name="robots" content="noarchive, noindex"> <meta name="referrer" content="origin-when-cross-origin"> <link href="https://static.zbmath.org/contrib/bootstrap/v3.3.7/css/bootstrap.min.css" rel="stylesheet" media="screen,print"> <link href="https://static.zbmath.org/contrib/bootstrap/v3.3.7/css/bootstrap-theme.min.css" rel="stylesheet" media="screen,print"> <link href="https://static.zbmath.org/contrib/bootstrap-lightbox/v0.7.0/bootstrap-lightbox.min.css" rel="stylesheet" media="screen,print"> <link rel="stylesheet" href="https://static.zbmath.org/contrib/bootstrap-select/v1.13.14/css/bootstrap-select.min.css"> <link href="/static/css/smoothness/jquery-ui-1.10.1.custom.min.css" rel="stylesheet" media="screen"> <link href="/static/styles.css?v=20241024" rel="stylesheet" media="screen,print"> <link href="https://static.zbmath.org/zbMathJax/v0.1.38/zbmathjax.css" rel="stylesheet" media="screen,print"> <link rel="shortcut icon" href="/static/zbmath.ico"> <script type="application/ld+json"> { "@context": "http://schema.org", "@type": "Organization", "url": "https://zbmath.org/", "logo": "https://zbmath.org/static/zbMATH.png" } </script> </head> <body> <div id="line"></div> <span id="clear" style="cursor: pointer;">×</span> <div id="page"> <div id="head"> <nav id="menu" class="navbar navbar-default"> <div class="container-fluid"> <div class="navbar-header"> <button type="button" class="navbar-toggle collapsed" data-toggle="collapse" data-target="#zbnav" aria-expanded="false"> <span class="sr-only">Toggle navigation</span> <span class="icon-bar"></span> <span class="icon-bar"></span> <span class="icon-bar"></span> </button> <a class="navbar-brand" href="#"> <img class="logo" src="/static/zbmath.gif" alt="zbMATH Open logo"> </a> </div> <div id="zbnav" class="collapse navbar-collapse"> <ul class="nav navbar-nav pages"> <li class="about"> <a href="/about/">About</a> </li> <li class="frequently-asked-questions"> <a href="/frequently-asked-questions/">FAQ</a> </li> <li class="general-help"> <a href="/general-help/">General Help</a> </li> <li class="reviewer-service"> <a href="https://zbmath.org/reviewer-service/" target="_self" >Reviewer Service</a> </li> <li> <a href="/tools-and-resources/">Tools & Resources</a> </li> <li class="contact"> <a href="/contact/">Contact</a> </li> </ul> <ul class="nav navbar-nav navbar-right prefs"> <li class="preferences dropdown"> <a data-toggle="dropdown" href="#">Preferences <i class="caret"></i></a> <ul class="dropdown-menu preferences"> <li> <form id="preferences" class="navbar-form" method="post" action="/preferences/" onsubmit="return confirm('This website uses cookies for the purposes of storing preference information on your device. Do you agree to this?\n\nPlease refer to our Privacy Policy to learn more about our use of cookies.')" > <input type="hidden" name="path" value="/1009.90054?"> <span class=""> <label class="title">Search Form</label> <div class="form-group"> <input id="search-multi-line" type="radio" name="search" value="multi-line" checked> <label for="search-multi-line" class="radio">Multi-Line Search (default)</label> </div> <div class="form-group"> <input id="search-one-line" type="radio" name="search" value="one-line"> <label for="search-one-line" class="radio">One-Line Search</label> </div> </span> <span class="count"> <label class="title">Hits per Page</label> <div class="form-group"> <input id="count-10" type="radio" name="count" value="10"> <label for="count-10" class="radio">10</label> </div> <div class="form-group"> <input id="count-20" type="radio" name="count" value="20"> <label for="count-20" class="radio">20</label> </div> <div class="form-group"> <input id="count-50" type="radio" name="count" value="50"> <label for="count-50" class="radio">50</label> </div> <div class="form-group"> <input id="count-100" type="radio" name="count" value="100" checked> <label for="count-100" class="radio">100 (default)</label> </div> <div class="form-group"> <input id="count-200" type="radio" name="count" value="200"> <label for="count-200" class="radio">200</label> </div> </span> <span class="format"> <label class="title">Display Format</label> <div class="form-group"> <input id="format-mathjax" type="radio" name="format" value="mathjax" checked> <label for="format-mathjax" class="radio">MathJax (default)</label> </div> <div class="form-group"> <input id="format-amstex" type="radio" name="format" value="latex"> <label for="format-amstex" class="radio">LaTeX</label> </div> </span> <span class="ranking"> <label class="title">Documents Sorting</label> <div class="form-group"> <input id="documents-ranking-default" type="radio" name="documents_ranking" value="date" checked> <label for="documents-ranking-default" class="radio">Newest first (default)</label> </div> <div class="form-group"> <input id="documents-ranking-references" type="radio" name="documents_ranking" value="references"> <label for="documents-ranking-references" class="radio">Citations</label> </div> <div class="form-group"> <input id="documents-ranking-relevance" type="radio" name="documents_ranking" value="relevance"> <label for="documents-ranking-relevance" class="radio">Relevance</label> </div> </span> <span class="ranking"> <label class="title">Authors Sorting</label> <div class="form-group"> <input id="authors-ranking-default" type="radio" name="authors_ranking" value="alpha" checked> <label for="authors-ranking-default" class="radio">Alphabetically (default)</label> </div> <div class="form-group"> <input id="authors-ranking-references" type="radio" name="authors_ranking" value="references"> <label for="authors-ranking-references" class="radio">Citations</label> </div> </span> <span class="ranking"> <label class="title">Serials Sorting</label> <div class="form-group"> <input id="serials-ranking-default" type="radio" name="serials_ranking" value="alpha" checked> <label for="serials-ranking-default" class="radio">Alphabetically (default)</label> </div> <div class="form-group"> <input id="serials-ranking-references" type="radio" name="serials_ranking" value="references"> <label for="serials-ranking-references" class="radio">Citations</label> </div> </span> <span class="ranking"> <label class="title">Software Sorting</label> <div class="form-group"> <input id="software-ranking-default" type="radio" name="software_ranking" value="references" checked> <label for="software-ranking-default" class="radio">Citations (default)</label> </div> <div class="form-group"> <input id="software-ranking-alpha" type="radio" name="software_ranking" value="alpha"> <label for="software-ranking-alpha" class="radio">Alphabetically</label> </div> </span> <button type="submit" class="btn btn-default">OK</button> <div class="clearfix"> </form> </li> </ul> </li> </ul> </div> </div> </nav> <div id="tabs"> <h1 class="logo"> <a class="logo" href="/"> <img class="logo" src="/static/zbmath.gif" alt="zbMATH Open — the first resource for mathematics" > </a> </h1> <nav> <ul class="nav nav-tabs"> <li class="tab-documents active"> <a href="/">Documents</a> </li> <li class="tab-authors"> <a href="/authors/">Authors</a> </li> <li class="tab-serials"> <a href="/serials/">Serials</a> </li> <li class="tab-software"> <a href="/software/">Software</a> </li> <li class="tab-classification"> <a href="/classification/">Classification</a> </li> <li class="tab-formulae"> <a href="/formulae/">Formulæ</a> </li> </ul> </nav> <div class="clearfix"></div> </div> <div class="content-fixed"> <div class="content-formular"> <div style="display: none;"> <div class="row ml-0"id="multi-line-new-line" style="display: none;"> <div class="col-xs-12 form-inline multi-line"> <select class="form-control multi-line-field multi-line-selectpicker" name="ml-0-f" aria-label="field"> <option data-type="input" value="any" selected>Anywhere</option> <option data-type="input" value="au">Authors</option> <option data-type="input" value="ti">Title</option> <option data-type="input" value="py">Year</option> <option data-type="range" value="pyr">Year Range</option> <option data-type="input" value="cc">MSC</option> <option data-type="input" value="cc1">MSC Primary</option> <option data-type="input" value="so">Source / Journal</option> <option data-type="input" value="pu">Publisher</option> <option data-type="input" value="la">Language</option> <option data-type="input" value="ab">Summary / Review</option> <option data-type="input" value="rv">Reviewer</option> <option data-type="input" value="an">zbMATH ID</option> <option data-type="input" value="en">External ID</option> <option data-type="input" value="ut">Keywords</option> <option data-type="input" value="sw">Software</option> <option data-type="input" value="br">Biographic Ref</option> <option data-type="input" value="rft">Reference Text</option> <option data-type="multiselect-db" value="db">Database</option> <option data-divider="true"></option> <option data-function="remove-line" data-content='<span class="glyphicon glyphicon-minus" aria-hidden="true"></span> remove line' value="any">remove line</option> </select><input name="ml-0-v" class="form-control multi-line-value multi-line-input" type="text" value="" aria-label="value"><select class="form-control multi-line-operators multi-line-selectpicker" name="ml-0-op" aria-label="operator"> <option value="and" selected>AND</option> <option value="andnot">AND NOT</option> <option value="or">OR</option> </select></div> </div> <input name="ml-0-v" class="form-control multi-line-value multi-line-input" type="text" value="" aria-label="value" id="multi-line-type-input"> <span class="multi-line-value" id="multi-line-type-range"><span style="padding-left: 5px;">from</span> <input name="ml-0-v1" class="form-control multi-line-input" type="text" value="" aria-label="value"> until <input name="ml-0-v2" class="form-control multi-line-input" type="text" value="" aria-label="value"></span> <input name="ml-0-v" class="form-control multi-line-value multi-line-input" type="text" value="" aria-label="value" id="multi-line-type-input-la" placeholder="use name or ISO code"> <input name="ml-0-v" class="form-control multi-line-value multi-line-input" type="text" value="" aria-label="value" id="multi-line-type-input-rv" placeholder="enter name or zbMATH reviewer number"> <input name="ml-0-v" class="form-control multi-line-value multi-line-input" type="text" value="" aria-label="value" id="multi-line-type-input-an" placeholder="Zbl, JFM or ERAM number"> <input name="ml-0-v" class="form-control multi-line-value multi-line-input" type="text" value="" aria-label="value" id="multi-line-type-input-en" placeholder="e.g. DOI, ISBN, arXiv ID"> <input name="ml-0-v" class="form-control multi-line-value multi-line-input" type="text" value="" aria-label="value" id="multi-line-type-input-sw" placeholder="use * to find all documents using software"> <input name="ml-0-v" class="form-control multi-line-value multi-line-input" type="text" value="" aria-label="value" id="multi-line-type-input-br" placeholder="find documents about the life or work of a person"> <span class="multi-line-value" id="multi-line-type-multiselect-db"> <select class="multi-line-selectpicker" data-width="100%" multiple> <option value="zbl">Zbl</option> <option value="arxiv">arXiv</option> <option value="jfm">JFM</option> <option value="eram">ERAM</option> </select> <input type="hidden" class="multi-line-input" name="ml-0-v" value=""> </span> </div> <form name="documents" method="GET" action="/" autocomplete="off"> <div class="documents multi-line" style="display: none;"> <div class="forms"> <ul class="nav forms"> <li class="one-line"> <span tabindex="0" class="glyphicon glyphicon-question-sign" title="One-Line Search allows for free logical combinations of search fields" aria-label="One-Line Search allows for free logical combinations of search fields" data-placement="bottom"></span> <a style="display: inline-block;" href="#">One-Line Search <span class="glyphicon glyphicon-search"></span></a> </li> </ul> </div> <div class="clearfix"></div> <div class="container-fluid"> <input type="hidden" id="multi-line-ml" name="ml" value="3"> <div id="multi-line-row-wrapper"> <div class="row ml-1"> <div class="col-xs-12 form-inline multi-line"> <select class="form-control multi-line-field multi-line-selectpicker" name="ml-1-f" aria-label="field"> <option data-type="input" value="any" selected>Anywhere</option> <option data-type="input" value="au">Authors</option> <option data-type="input" value="ti">Title</option> <option data-type="input" value="py">Year</option> <option data-type="range" value="pyr">Year Range</option> <option data-type="input" value="cc">MSC</option> <option data-type="input" value="cc1">MSC Primary</option> <option data-type="input" value="so">Source / Journal</option> <option data-type="input" value="pu">Publisher</option> <option data-type="input" value="la">Language</option> <option data-type="input" value="ab">Summary / Review</option> <option data-type="input" value="rv">Reviewer</option> <option data-type="input" value="an">zbMATH ID</option> <option data-type="input" value="en">External ID</option> <option data-type="input" value="ut">Keywords</option> <option data-type="input" value="sw">Software</option> <option data-type="input" value="br">Biographic Ref</option> <option data-type="input" value="rft">Reference Text</option> <option data-type="multiselect-db" value="db">Database</option> <option data-divider="true"></option> <option data-function="remove-line" data-content='<span class="glyphicon glyphicon-minus" aria-hidden="true"></span> remove line' value="any">remove line</option> </select><input name="ml-1-v" class="form-control multi-line-value multi-line-input" type="text" value="" aria-label="value"><select class="form-control multi-line-operators multi-line-selectpicker" name="ml-1-op" aria-label="operator"> <option value="and" selected>AND</option> <option value="andnot">AND NOT</option> <option value="or">OR</option> </select></div> </div> <div class="row ml-2"> <div class="col-xs-12 form-inline multi-line"> <select class="form-control multi-line-field multi-line-selectpicker" name="ml-2-f" aria-label="field"> <option data-type="input" value="any">Anywhere</option> <option data-type="input" value="au" selected>Authors</option> <option data-type="input" value="ti">Title</option> <option data-type="input" value="py">Year</option> <option data-type="range" value="pyr">Year Range</option> <option data-type="input" value="cc">MSC</option> <option data-type="input" value="cc1">MSC Primary</option> <option data-type="input" value="so">Source / Journal</option> <option data-type="input" value="pu">Publisher</option> <option data-type="input" value="la">Language</option> <option data-type="input" value="ab">Summary / Review</option> <option data-type="input" value="rv">Reviewer</option> <option data-type="input" value="an">zbMATH ID</option> <option data-type="input" value="en">External ID</option> <option data-type="input" value="ut">Keywords</option> <option data-type="input" value="sw">Software</option> <option data-type="input" value="br">Biographic Ref</option> <option data-type="input" value="rft">Reference Text</option> <option data-type="multiselect-db" value="db">Database</option> <option data-divider="true"></option> <option data-function="remove-line" data-content='<span class="glyphicon glyphicon-minus" aria-hidden="true"></span> remove line' value="any">remove line</option> </select><input name="ml-2-v" class="form-control multi-line-value multi-line-input" type="text" value="" aria-label="value"><select class="form-control multi-line-operators multi-line-selectpicker" name="ml-2-op" aria-label="operator"> <option value="and" selected>AND</option> <option value="andnot">AND NOT</option> <option value="or">OR</option> </select></div> </div> <div class="row ml-3"> <div class="col-xs-12 form-inline multi-line"> <select class="form-control multi-line-field multi-line-selectpicker" name="ml-3-f" aria-label="field"> <option data-type="input" value="any">Anywhere</option> <option data-type="input" value="au">Authors</option> <option data-type="input" value="ti" selected>Title</option> <option data-type="input" value="py">Year</option> <option data-type="range" value="pyr">Year Range</option> <option data-type="input" value="cc">MSC</option> <option data-type="input" value="cc1">MSC Primary</option> <option data-type="input" value="so">Source / Journal</option> <option data-type="input" value="pu">Publisher</option> <option data-type="input" value="la">Language</option> <option data-type="input" value="ab">Summary / Review</option> <option data-type="input" value="rv">Reviewer</option> <option data-type="input" value="an">zbMATH ID</option> <option data-type="input" value="en">External ID</option> <option data-type="input" value="ut">Keywords</option> <option data-type="input" value="sw">Software</option> <option data-type="input" value="br">Biographic Ref</option> <option data-type="input" value="rft">Reference Text</option> <option data-type="multiselect-db" value="db">Database</option> <option data-divider="true"></option> <option data-function="remove-line" data-content='<span class="glyphicon glyphicon-minus" aria-hidden="true"></span> remove line' value="any">remove line</option> </select><input name="ml-3-v" class="form-control multi-line-value multi-line-input" type="text" value="" aria-label="value"><div id="multi-line-plus"> <a href="#"><span class="glyphicon glyphicon-plus" aria-hidden="true"></span> add line</a> </div></div> </div> </div> <div class="row"> <div class="col-xs-12 form-inline"> <div class="form-group field checkboxes-wrapper" id="checkboxes-wrapper-test" style="visibility: hidden; position: fixed;"> <label>Document Type:</label> <div class="checkboxes"> <div class="slider"> <label title="search for Articles in Journals"> <input type="checkbox" class="form-control" value="j" checked> <span tabindex="0"><small></small></span> Journal Articles </label> </div> <div class="slider"> <label title="search for Articles in Conference Proceedings and Collected Volumes"> <input type="checkbox" class="form-control" value="a" checked> <span tabindex="0"><small></small></span> Collection Articles </label> </div> <div class="slider"> <label title="search for Monographs, Proceedings, Dissertations etc."> <input type="checkbox" class="form-control" value="b" checked> <span tabindex="0"><small></small></span> Books </label> </div> <div class="slider"> <label title="search for arXiv Preprints"> <input type="checkbox" class="form-control" value="p" checked> <span tabindex="0"><small></small></span> arXiv Preprints </label> </div> </div> </div> <div class="form-group field checkboxes-wrapper" id="checkboxes-wrapper-real"> <label>Document Type:</label> <div class="checkboxes"> <div class="slider"> <label for="dt-j" title="search for Articles in Journals"> <input type="checkbox" id="dt-j" name="dt" class="form-control" value="j" checked> <span tabindex="0"><small></small></span> Journal Articles </label> </div> <div class="slider"> <label for="dt-a" title="search for Articles in Conference Proceedings and Collected Volumes"> <input type="checkbox" id="dt-a" name="dt" class="form-control" value="a" checked> <span tabindex="0"><small></small></span> Collection Articles </label> </div> <div class="slider"> <label for="dt-b" title="search for Monographs, Proceedings, Dissertations etc."> <input type="checkbox" id="dt-b" name="dt" class="form-control" value="b" checked> <span tabindex="0"><small></small></span> Books </label> </div> <div class="slider"> <label for="dt-p" title="search for arXiv Preprints"> <input type="checkbox" id="dt-p" name="dt" class="form-control" value="p" checked> <span tabindex="0"><small></small></span> arXiv Preprints </label> </div> </div> </div> </div> </div> <div class="row"> <div class="col-xs-12 buttons"> <a tabindex="0" class="btn btn-default clear-all">Reset all <span class="glyphicon glyphicon-remove"></span></a> <div class="submit"> <button class="btn btn-default search" type="submit">Search <span class="glyphicon glyphicon-search"></span></button> </div> </div> </div> </div> </div> </form> <form class="form-inline" name="documents" method="GET" action="/"> <div class="documents one-line" style="display: block;"> <div class="forms"> <ul class="nav forms"> <li class="multi-line"><a href="#">New Multi-Line Search <span class="glyphicon glyphicon-list"></span></a></li> </ul> </div> <div id="search-row" class="input-group box"> <span> <div id="search-field"> <input class="query form-control" type="text" name="q" value="an:1009.90054" aria-label="Search for documents" placeholder="Search for documents" autocomplete="off"> </div> <div class="search-buttons input-group-btn"> <div class="btn-group"> <button class="btn btn-default search" type="submit"><span class="virtual">Search</span> <span class="glyphicon glyphicon-search" style="top: 2px;"></span></button> </div> </div> </span> <span> <div class="search-buttons input-group-btn"> <div class="btn-group"> <div class="btn-group fields"> <button class="btn btn-default dropdown-toggle" data-toggle="dropdown">Fields <i class="caret"></i></button> <ul id="fields" class="dropdown-menu pull-right"> <li><a href="#"><span class="token item">any:</span><span> </span>anywhere (default)</a></li> <li><a href="#"><span class="token item">ab:</span><span>  </span>review text</a></li> <li><a href="#"><span class="token item">an:</span><span>  </span>zbmath id</a></li> <li><a href="#"><span class="token item">any:</span><span>  </span>anywhere</a></li> <li><a href="#"><span class="token item">au:</span><span>  </span>contributor name</a></li> <li><a href="#"><span class="token item">br:</span><span>  </span>biographic reference name</a></li> <li><a href="#"><span class="token item">cc:</span><span>  </span>msc title</a></li> <li><a href="#"><span class="token item">dt:</span><span>  </span>document type</a></li> <li><a href="#"><span class="token item">doi:</span><span>  </span>doi</a></li> <li><a href="#"><span class="token item">en:</span><span>  </span>external id</a></li> <li><a href="#"><span class="token item">la:</span><span>  </span>language</a></li> <li><a href="#"><span class="token item">pu:</span><span>  </span>publisher</a></li> <li><a href="#"><span class="token item">py:</span><span>  </span>year</a></li> <li><a href="#"><span class="token item">rv:</span><span>  </span>reviewer name</a></li> <li><a href="#"><span class="token item">so:</span><span>  </span>source</a></li> <li><a href="#"><span class="token item">sw:</span><span>  </span>software name</a></li> <li><a href="#"><span class="token item">ti:</span><span>  </span>title</a></li> <li><a href="#"><span class="token item">ut:</span><span>  </span>keyword</a></li> </ul> </div> <div class="btn-group operators"> <button class="btn btn-default dropdown-toggle" data-toggle="dropdown">Operators <i class="caret"></i></button> <ul id="operators" class="dropdown-menu pull-right"> <li><a href="#"><span class="token">a <span class="item">&</span> b </span><span> </span>logical and (default)</a></li> <li><a href="#"><span class="token">a <span class="item">|</span> b </span><span> </span>logical or</a></li> <li><a href="#"><span class="token"><span class="item">!</span>ab   </span><span> </span>logical not</a></li> <li><a href="#"><span class="token">abc<span class="item">*</span>  </span><span> </span>right wildcard</a></li> <li><a href="#"><span class="token"><span class="item">"</span>ab c<span class="item">"</span></span><span> </span>phrase</a></li> <li><a href="#"><span class="token"><span class="item">(</span>ab c<span class="item">)</span></span><span> </span>parentheses</a></li> </ul> </div> </div> </div> <div class="special"> <ul class="nav help-button"> <li class="dropdown pull-right"> <a href="#">Help <i class="caret"></i></a> </li> </ul> </div> </span> </div> <div class="help"><h2>Examples</h2> <div id="help-terms" role="table"> <div class="help-item" role="row"> <span class="search-example" role="rowheader"><a href="/?q=Geometry">Geometry</a></span> <span class="search-explanation" role="cell" role="cell">Search for the term <em>Geometry</em> in <strong>any</strong> field. Queries are <strong>case-independent</strong>.</span> </div> <div class="help-item" role="row"> <span class="search-example" role="rowheader"><a href="/?q=Funct%2A">Funct*</a></span> <span class="search-explanation" role="cell"><strong>Wildcard</strong> queries are specified by <strong><u>*</u></strong> (e.g. <em>functions</em>, <em>functorial</em>, etc.). Otherwise the search is <strong>exact</strong>.</span> </div> <div class="help-item" role="row"> <span class="search-example" role="rowheader"><a href="/?q=%22Topological+group%22">"Topological group"</a></span> <span class="search-explanation" role="cell"><strong>Phrases</strong> (multi-words) should be set in <u>"</u>straight quotation marks<u>"</u>.</span> </div> <div class="help-item" role="row"> <span class="search-example" role="rowheader"><a href="/?q=au%3A+Bourbaki+%26+ti%3A+Algebra">au: Bourbaki & ti: Algebra</a></span> <span class="search-explanation" role="cell">Search for <strong><u>au</u>thor</strong> and <strong><u>ti</u>tle</strong>. The <strong>and-operator &</strong> is default and can be omitted.</span> </div> <div class="help-item" role="row"> <span class="search-example" role="rowheader"><a href="/?q=Chebyshev+%7C+Tschebyscheff">Chebyshev | Tschebyscheff</a></span> <span class="search-explanation" role="cell">The <strong>or-operator |</strong> allows to search for <em>Chebyshev</em> or <em>Tschebyscheff</em>.</span> </div> <div class="help-item" role="row"> <span class="search-example" role="rowheader"><a href="/?q=Quasi%2A+map%2A+py%3A+1989">Quasi* map* py: 1989</a></span> <span class="search-explanation" role="cell">The resulting documents have <strong><u>p</u>ublication <u>y</u>ear</strong> <em>1989</em>.</span> </div> <div class="help-item" role="row"> <span class="search-example" role="rowheader"><a href="/?q=so%3A+Eur%2A+J%2A+Mat%2A+Soc%2A+cc%3A+14">so: Eur* J* Mat* Soc* cc: 14</a></span> <span class="search-explanation" role="cell">Search for publications in a particular <strong><u>so</u>urce</strong> with a <strong>Mathematics Subject <u>C</u>lassification <u>c</u>ode (<u>cc</u>)</strong> in <em>14</em>.</span> </div> <div class="help-item" role="row"> <span class="search-example" role="rowheader"><a href="/?q=%22Partial+diff%2A+eq%2A%22+%21+elliptic">"Partial diff* eq*" ! elliptic</a></span> <span class="search-explanation" role="cell">The <strong>not</strong>-operator <strong>!</strong> eliminates all results containing the word <em>elliptic</em>.</span> </div> <div class="help-item" role="row"> <span class="search-example" role="rowheader"><a href="/?q=dt%3A+b+%26+au%3A+Hilbert">dt: b & au: Hilbert</a></span> <span class="search-explanation" role="cell">The <strong><u>d</u>ocument <u>t</u>ype</strong> is set to books; alternatively: <u>j</u> for <strong>journal articles</strong>, <u>a</u> for <strong>book articles</strong>.</span> </div> <div class="help-item" role="row"> <span class="search-example" role="rowheader"><a href="/?q=py%3A+2000-2015+cc%3A+%2894A+%7C+11T%29">py: 2000-2015 cc: (94A | 11T)</a></span> <span class="search-explanation" role="cell">Number <strong>ranges</strong> are accepted. Terms can be grouped within <strong><u>(</u>parentheses<u>)</u></strong>.</span> </div> <div class="help-item" role="row"> <span class="search-example" role="rowheader"><a href="/?q=la%3A+chinese">la: chinese</a></span> <span class="search-explanation" role="cell">Find documents in a given <strong><u>la</u>nguage</strong>. <a href="http://en.wikipedia.org/wiki/ISO_639-1">ISO 639-1</a> language codes can also be used.</span> </div> </div> <div id="help-fields"> <h2>Fields</h2> <table> <tr> <td class="nowrap padding" role="rowheader"><strong>any</strong></td> <td class="padding">anywhere</td> </tr> <tr> <td class="nowrap padding" role="rowheader"><strong>an</strong></td> <td class="padding">internal document identifier</td> </tr> <tr> <td class="nowrap padding" role="rowheader"><strong>au</strong></td> <td class="padding">author, editor</td> </tr> <tr> <td class="nowrap padding" role="rowheader"><strong>ai</strong></td> <td class="padding">internal author identifier</td> </tr> <tr> <td class="nowrap padding" role="rowheader"><strong>ti</strong></td> <td class="padding">title</td> </tr> <tr> <td class="nowrap padding" role="rowheader"><strong>la</strong></td> <td class="padding">language</td> </tr> <tr> <td class="nowrap padding" role="rowheader"><strong>so</strong></td> <td class="padding">source</td> </tr> <tr> <td class="nowrap padding" role="rowheader"><strong>ab</strong></td> <td class="padding">review, abstract</td> </tr> <tr> <td class="nowrap padding" role="rowheader"><strong>py</strong></td> <td class="padding">publication year</td> </tr> <tr> <td class="nowrap padding" role="rowheader"><strong>rv</strong></td> <td class="padding">reviewer</td> </tr> <tr> <td class="nowrap padding" role="rowheader"><strong>cc</strong></td> <td class="padding">MSC code</td> </tr> <tr> <td class="nowrap padding" role="rowheader"><strong>ut</strong></td> <td class="padding">uncontrolled term</td> </tr> <tr> <td class="nowrap padding" role="rowheader"><strong>dt</strong></td> <td class="padding" colspan="4">document type (<strong>j</strong>: journal article; <strong>b</strong>: book; <strong>a</strong>: book article)</td> </tr> </table> </div> <div id="help-operators"> <h2>Operators</h2> <table> <tr> <td class="nowrap padding" role="rowheader">a <strong>&</strong> b</td> <td class="padding">logic and</td> </tr> <tr> <td class="nowrap padding" role="rowheader">a <strong>|</strong> b</td> <td class="padding">logic or</td> </tr> <tr> <td class="nowrap padding" role="rowheader"><strong>!</strong>ab</td> <td class="padding">logic not</td> </tr> <tr> <td class="nowrap padding" role="rowheader">abc<strong>*</strong></td> <td class="padding">right wildcard</td> </tr> <tr> <td class="nowrap padding" role="rowheader"><strong>"</strong>ab c<strong>"</strong></td> <td class="padding">phrase</td> </tr> <tr> <td class="nowrap padding" role="rowheader"><strong>(</strong>ab c<strong>)</strong></td> <td class="padding">parentheses</td> </tr> </table> </div> <p> See also our <a href="/general-help/">General Help</a>. </p></div> </div> </form> <div class="clearfix"></div> </div> <div class="content-shadow"></div> </div> </div> <div id="body"> <div id="main"> <div class="messages"> </div> <div id="documents"> <div class="content-main"> <div class="content-item"><div class="item"> <article> <div class="author"><a href="/authors/gordon.valery-s" title="Author Profile">Gordon, Valery</a>; <a href="/authors/proth.jean-marie" title="Author Profile">Proth, Jean-Marie</a>; <a href="/authors/chu.chengbin" title="Author Profile">Chu, Chengbin</a></div> <h2 class="title"> <strong>A survey of the state-of-the-art of common due date assignment and scheduling research.</strong> <i>(English)</i> <a class="label nowrap" href="/1009.90054">Zbl 1009.90054</a> </h2> <div class="source"> <a href="/serials/1574" title="Journal Profile">Eur. J. Oper. Res.</a> <a href="/?q=in%3A83686" title="Articles in this Issue">139, No. 1, 1-25 (2002)</a>. </div> <div class="abstract">Summary: We aim at providing a unified framework of the common due date assignment and scheduling problems in the deterministic case by surveying the literature concerning the models involving single machine and parallel machines. The problems with due date determination have received considerable attention in the last 15 years due to the introduction of new methods of inventory management such as just-in-time concepts. The common due date model corresponds, for instance, to an assembly system in which the components of the product should be ready at the same time, or to a shop where several jobs constitute a single customer’s order. In the problems under consideration, the objective is to find an optimal value of the common due date and the related optimal schedule in order to optimize a given criterion based on the due date and the completion times of jobs. The results on the algorithms and complexity of the common due date assignment and scheduling problems are summarized.</div> <div class="clear"></div> <br> <div class="citations"><div class="clear"><a href="/?q=rf%3A1756567">Cited in <strong>146</strong> Documents</a></div></div> <div class="classification"> <h3>MSC:</h3> <table><tr> <td> <a class="mono" href="/classification/?q=cc%3A90B35" title="MSC2020">90B35</a> </td> <td class="space"> Deterministic scheduling theory in operations research </td> </tr></table> </div><div class="keywords"> <h3>Keywords:</h3><a href="/?q=ut%3Ascheduling">scheduling</a>; <a href="/?q=ut%3Asequencing">sequencing</a>; <a href="/?q=ut%3Adue+date+assignment">due date assignment</a>; <a href="/?q=ut%3Acommon+due+date">common due date</a></div>  <div class="modal fade" id="metadataModal" tabindex="-1" role="dialog" aria-labelledby="myModalLabel"> <div class="modal-dialog" role="document"> <div class="modal-content"> <div class="modal-header"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> <h4 class="modal-title" id="myModalLabel">Cite</h4> </div> <div class="modal-body"> <div class="form-group"> <label for="select-output" class="control-label">Format</label> <select id="select-output" class="form-control" aria-label="Select Metadata format"></select> </div> <div class="form-group"> <label for="metadataText" class="control-label">Result</label> <textarea class="form-control" id="metadataText" rows="10" style="min-width: 100%;max-width: 100%"></textarea> </div> <div id="metadata-alert" class="alert alert-danger" role="alert" style="display: none;">  </div> </div> <div class="modal-footer"> <button type="button" class="btn btn-primary" onclick="copyMetadata()">Copy to clipboard</button> <button type="button" class="btn btn-default" data-dismiss="modal">Close</button> </div> </div> </div> </div> <div class="functions clearfix"> <div class="function">  <a type="button" class="btn btn-default btn-xs pdf" data-toggle="modal" data-target="#metadataModal" data-itemtype="Zbl" data-itemname="Zbl 1009.90054" data-ciurl="/ci/01756567" data-biburl="/bibtex/01756567.bib" data-amsurl="/amsrefs/01756567.bib" data-xmlurl="/xml/01756567.xml" > Cite </a> <a class="btn btn-default btn-xs pdf" data-container="body" type="button" href="/pdf/01756567.pdf" title="Zbl 1009.90054 as PDF">Review PDF</a> </div> <div class="fulltexts"> <span class="fulltext">Full Text:</span> <a class="btn btn-default btn-xs" type="button" href="https://doi.org/10.1016/S0377-2217(01)00181-3" aria-label="DOI for “A survey of the state-of-the-art of common due date assignment and scheduling research”" title="10.1016/S0377-2217(01)00181-3">DOI</a> </div> <div class="sfx" style="float: right;"> </div> </div> <div class="references"> <h3>References:</h3> <table><tr> <td>[1]</td> <td class="space">Adamopoulos, G. I.; Pappis, C. P., Scheduling under a common due-date on parallel unrelated machines, European Journal of Operational Research, 105, 494-501 (1998) · <a href="/0955.90030" class="nowrap">Zbl 0955.90030</a></td> </tr><tr> <td>[2]</td> <td class="space">Alidaee, B.; Ahmadian, A., Two parallel machine sequencing problems involving controllable job processing times, European Journal of Operational Research, 70, 335-341 (1993) · <a href="/0791.90028" class="nowrap">Zbl 0791.90028</a></td> </tr><tr> <td>[3]</td> <td class="space">Alidaee, B.; Panwalkar, S. S., Single stage minimum absolute lateness problem with a common due date on non-identical machines, Journal of the Operational Research Society, 44, 29-36 (1993) · <a href="/0772.90050" class="nowrap">Zbl 0772.90050</a></td> </tr><tr> <td>[4]</td> <td class="space">Azizoglu, M.; Webster, S., Scheduling about an unrestricted common due window with arbitrary earliness/tardiness penalty rates, IIE Transactions, 29, 1001-1006 (1997)</td> </tr><tr> <td>[5]</td> <td class="space">Azizoglu, M.; Webster, S., Scheduling job families about an unrestricted common due date on a single machine, International Journal of Production Research, 35, 1321-1330 (1997) · <a href="/0942.90547" class="nowrap">Zbl 0942.90547</a></td> </tr><tr> <td>[6]</td> <td class="space">Bagchi, U.; Chang, Y. L.; Sullivan, R. S., Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date, Naval Research Logistics, 34, 739-751 (1987) · <a href="/0657.90052" class="nowrap">Zbl 0657.90052</a></td> </tr><tr> <td>[7]</td> <td class="space">Bagchi, U.; Sullivan, R. S.; Chang, Y. L., Minimizing mean absolute deviation of completion times about a common due date, Naval Research Logistics, 33, 227-240 (1986) · <a href="/0599.90049" class="nowrap">Zbl 0599.90049</a></td> </tr><tr> <td>[8]</td> <td class="space">Bagchi, U.; Sullivan, R. S.; Chang, Y. L., Minimizing mean squared deviation of completion times about a common due date, Management Science, 33, 894-906 (1987) · <a href="/0636.90049" class="nowrap">Zbl 0636.90049</a></td> </tr><tr> <td>[9]</td> <td class="space">Baker, K. R.; Scudder, G. D., On the assignment of optimal due dates, Journal of the Operational Research Society, 40, 93-95 (1989) · <a href="/0674.90052" class="nowrap">Zbl 0674.90052</a></td> </tr><tr> <td>[10]</td> <td class="space">Baker, K. R.; Scudder, G. D., Sequencing with earliness and tardiness penalties: A review, Operations Research, 38, 22-36 (1990) · <a href="/0699.90052" class="nowrap">Zbl 0699.90052</a></td> </tr><tr> <td>[11]</td> <td class="space">Bector, C. R.; Gupta, Y. P.; Gupta, M. C., Determination of an optimal common due date and optimal sequence in a single machine job shop, International Journal of Production Research, 26, 613-628 (1988) · <a href="/0644.90047" class="nowrap">Zbl 0644.90047</a></td> </tr><tr> <td>[12]</td> <td class="space">Biskup, D., Single-machine scheduling with learning considerations, European Journal of Operational Research, 115, 173-178 (1999) · <a href="/0946.90025" class="nowrap">Zbl 0946.90025</a></td> </tr><tr> <td>[13]</td> <td class="space">Biskup, D.; Cheng, T. C.E., Single-machine scheduling with controllable processing times and earliness, tardiness and completion time penalties, Engineering Optimization, 31, 329-336 (1999)</td> </tr><tr> <td>[14]</td> <td class="space">Biskup, D.; Cheng, T. C.E., Multiple-machine scheduling with earliness, tardiness and completion time penalties, Computers and Operations Research, 26, 45-57 (1999) · <a href="/0957.90056" class="nowrap">Zbl 0957.90056</a></td> </tr><tr> <td>[15]</td> <td class="space">Biskup, D.; Feldmann, M., Benchmarks for scheduling on a single-machine against restrictive and unrestrictive common due dates, Computers and Operations Research, 28, 787-801 (2001) · <a href="/1003.90020" class="nowrap">Zbl 1003.90020</a></td> </tr><tr> <td>[16]</td> <td class="space">Biskup, D.; Jahnke, H., Common due date assignment for scheduling on a single machine with jointly reducible processing times, International Journal of Production Economics, 69, 317-322 (2001)</td> </tr><tr> <td>[17]</td> <td class="space">Blazewicz, J.; Ecker, K.; Pesch, E.; Schmidt, G.; Weglarz, J., Scheduling Computer and Manufacturing Processes (1996), Springer: Springer Berlin · <a href="/0911.90201" class="nowrap">Zbl 0911.90201</a></td> </tr><tr> <td>[18]</td> <td class="space">Blazewicz, J.; Ecker, K.; Schmidt, G.; Weglarz, J., Scheduling in Computer and Manufacturing Systems (1993), Springer: Springer Berlin · <a href="/0767.90033" class="nowrap">Zbl 0767.90033</a></td> </tr><tr> <td>[19]</td> <td class="space">Blazewicz, J., Pesch, E., Sterna, M., Werner, F., 2000. Total late work criteria for scheduling problems. In: Inderfurth, K. et al. (Eds.) Operations Research Proceedings 1999, Springer, Berlin, pp. 354-359; Blazewicz, J., Pesch, E., Sterna, M., Werner, F., 2000. Total late work criteria for scheduling problems. In: Inderfurth, K. et al. (Eds.) Operations Research Proceedings 1999, Springer, Berlin, pp. 354-359 · <a href="/1015.90037" class="nowrap">Zbl 1015.90037</a></td> </tr><tr> <td>[20]</td> <td class="space">Brucker, P., Scheduling Algorithms (1998), Springer: Springer Berlin · <a href="/0914.90157" class="nowrap">Zbl 0914.90157</a></td> </tr><tr> <td>[21]</td> <td class="space">Bruno, J. L.; Coffman, E. G.; Sethi, R., Scheduling independent tasks to reduce mean finishing time, Communications of the ACM, 17, 382-387 (1974) · <a href="/0283.68039" class="nowrap">Zbl 0283.68039</a></td> </tr><tr> <td>[22]</td> <td class="space">Cai, X., Minimization of agreeably weighted variance in single machine systems, European Journal of Operational Research, 85, 576-592 (1995) · <a href="/0912.90172" class="nowrap">Zbl 0912.90172</a></td> </tr><tr> <td>[23]</td> <td class="space">Cai, X.; Lum, V. Y.S.; Chan, J. M.T., Scheduling about a common due date with job-dependent asymmetric earliness and tardiness penalties, European Journal of Operational Research, 98, 154-168 (1997) · <a href="/0922.90084" class="nowrap">Zbl 0922.90084</a></td> </tr><tr> <td>[24]</td> <td class="space">Chen, B., Potts, C.N., Woeginger, G.J., 1998. A review of machine scheduling: Complexity, algorithms and approximability. In: Du, D.-Z., Pardalos, P.M. (Eds.), Handbook of Combinatorial Optimization, Kluwer, Dordrecht, pp. 21-169; Chen, B., Potts, C.N., Woeginger, G.J., 1998. A review of machine scheduling: Complexity, algorithms and approximability. In: Du, D.-Z., Pardalos, P.M. (Eds.), Handbook of Combinatorial Optimization, Kluwer, Dordrecht, pp. 21-169 · <a href="/0944.90022" class="nowrap">Zbl 0944.90022</a></td> </tr><tr> <td>[25]</td> <td class="space">Chen, D.; Li, S.; Tang, G., Single machine scheduling with common due date assignment in a group technology environment, Mathematical and Computer Modelling, 25, 81-90 (1997) · <a href="/0894.90076" class="nowrap">Zbl 0894.90076</a></td> </tr><tr> <td>[26]</td> <td class="space">Chen, Z.-L., Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs, European Journal of Operational Research, 93, 49-60 (1996) · <a href="/0916.90147" class="nowrap">Zbl 0916.90147</a></td> </tr><tr> <td>[27]</td> <td class="space">Cheng, T. C.E., A duality approach to optimal due-date determination, Engineering Optimization, 9, 127-130 (1985)</td> </tr><tr> <td>[28]</td> <td class="space">Cheng, T. C.E., An algorithm for the CON due-date determination and sequencing problem, Computers and Operations Research, 14, 537-542 (1987) · <a href="/0634.90030" class="nowrap">Zbl 0634.90030</a></td> </tr><tr> <td>[29]</td> <td class="space">Cheng, T. C.E., Minimizing the maximum deviation of job completion time about a common due-date, Computers and Mathematics with Applications, 14, 279-283 (1987) · <a href="/0636.90045" class="nowrap">Zbl 0636.90045</a></td> </tr><tr> <td>[30]</td> <td class="space">Cheng, T. C.E., Optimal common due-date with limited completion time deviation, Computers and Operations Research, 15, 91-96 (1988) · <a href="/0635.90050" class="nowrap">Zbl 0635.90050</a></td> </tr><tr> <td>[31]</td> <td class="space">Cheng, T.C.E., 1988b. An alternative proof of optimality for the common due-date assignment problem, European Journal of Operational Research 37, 250-253; Corrigendum: European Journal of Operational Research 38 (1989) 259; Cheng, T.C.E., 1988b. An alternative proof of optimality for the common due-date assignment problem, European Journal of Operational Research 37, 250-253; Corrigendum: European Journal of Operational Research 38 (1989) 259 · <a href="/0652.90059" class="nowrap">Zbl 0652.90059</a></td> </tr><tr> <td>[32]</td> <td class="space">Cheng, T. C.E., A heuristic for common due-date assignment and job scheduling on parallel machines, Journal of the Operational Research Society, 40, 1129-1135 (1989) · <a href="/0699.90060" class="nowrap">Zbl 0699.90060</a></td> </tr><tr> <td>[33]</td> <td class="space">Cheng, T. C.E., A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem, Computers and Operations Research, 17, 321-324 (1990) · <a href="/0699.90061" class="nowrap">Zbl 0699.90061</a></td> </tr><tr> <td>[34]</td> <td class="space">Cheng, T. C.E., Common due-date assignment and scheduling for a single processor to minimize the number of tardy jobs, Engineering Optimization, 16, 129-136 (1990)</td> </tr><tr> <td>[35]</td> <td class="space">Cheng, T. C.E., Optimal constant due-date determination and sequencing of $n$ jobs on a single machine, International Journal of Production Economics, 22, 259-261 (1991)</td> </tr><tr> <td>[36]</td> <td class="space">Cheng, T. C.E.; Chen, Z.-L., Parallel-machine scheduling problems with earliness and tardiness penalties, Journal of the Operational Research Society, 45, 685-695 (1994) · <a href="/0829.90077" class="nowrap">Zbl 0829.90077</a></td> </tr><tr> <td>[37]</td> <td class="space">Cheng, T. C.E.; Gupta, M. C., Survey of scheduling research involving due date determination decisions, European Journal of Operational Research, 38, 156-166 (1989) · <a href="/0658.90049" class="nowrap">Zbl 0658.90049</a></td> </tr><tr> <td>[38]</td> <td class="space">Cheng, T. C.E.; Kovalyov, M. Y., Batch scheduling and common due-date assignment on a single machine, Discrete Applied Mathematics, 70, 231-245 (1996) · <a href="/0871.90044" class="nowrap">Zbl 0871.90044</a></td> </tr><tr> <td>[39]</td> <td class="space">Cheng, T. C.E.; Oguz, C.; Qi, X. D., Due-date assignment and single machine scheduling with compressible processing times, International Journal of Production Economics, 43, 29-35 (1996)</td> </tr><tr> <td>[40]</td> <td class="space">Cheng, T. C.E.; Sin, C. C.S., A state-of-the-art review of parallel-machine scheduling research, European Journal of Operational Research, 47, 271-292 (1990) · <a href="/0707.90053" class="nowrap">Zbl 0707.90053</a></td> </tr><tr> <td>[41]</td> <td class="space">Conway, R. W., Priority dispatching and job lateness in a job shop, Journal of Industrial Engineering, 16, 228-237 (1965)</td> </tr><tr> <td>[42]</td> <td class="space">Chretienne, P., Coffman, Jr., E.G., Lenstra, J. K., Liu, Z. (Eds.), 1995. Scheduling Theory and its Applications. Wiley, Chichester; Chretienne, P., Coffman, Jr., E.G., Lenstra, J. K., Liu, Z. (Eds.), 1995. Scheduling Theory and its Applications. Wiley, Chichester · <a href="/0873.90049" class="nowrap">Zbl 0873.90049</a></td> </tr><tr> <td>[43]</td> <td class="space">Davis, J. S.; Kanet, J. J., Single-machine scheduling with early and tardy completion costs, Naval Research Logistics, 40, 85-101 (1993) · <a href="/0769.90048" class="nowrap">Zbl 0769.90048</a></td> </tr><tr> <td>[44]</td> <td class="space">De, P.; Ghosh, J. B.; Wells, C. E., A note on the minimization of mean squared deviation of completion times about a common due date, Management Science, 35, 1143-1147 (1989) · <a href="/0683.90039" class="nowrap">Zbl 0683.90039</a></td> </tr><tr> <td>[45]</td> <td class="space">De, P.; Ghosh, J. B.; Wells, C. E., CON due-date determination and sequencing, Computers and Operations Research, 17, 333-342 (1990) · <a href="/0693.90048" class="nowrap">Zbl 0693.90048</a></td> </tr><tr> <td>[46]</td> <td class="space">De, P.; Ghosh, J. B.; Wells, C. E., Scheduling about a common due date with earliness and tardiness penalties, Computers and Operations Research, 17, 231-241 (1990) · <a href="/0693.90055" class="nowrap">Zbl 0693.90055</a></td> </tr><tr> <td>[47]</td> <td class="space">De, P.; Ghosh, J. B.; Wells, C. E., Optimal delivery time quotation and order sequencing, Decision Science, 22, 379-390 (1991)</td> </tr><tr> <td>[48]</td> <td class="space">De, P.; Ghosh, J. B.; Wells, C. E., On the multiple-machine extension to a common due-date assignment and scheduling problem, Journal of the Operational Research Society, 42, 419-422 (1991)</td> </tr><tr> <td>[49]</td> <td class="space">De, P.; Ghosh, J. B.; Wells, C. E., On the minimization of completion time variance with a bicriteria extension, Operations Research, 40, 1148-1155 (1992) · <a href="/0770.90032" class="nowrap">Zbl 0770.90032</a></td> </tr><tr> <td>[50]</td> <td class="space">De, P.; Ghosh, J. B.; Wells, C. E., On the general solution for a class of early/tardy problems, Computers and Operations Research, 20, 141-149 (1993) · <a href="/0794.90021" class="nowrap">Zbl 0794.90021</a></td> </tr><tr> <td>[51]</td> <td class="space">De, P.; Ghosh, J. B.; Wells, C. E., Solving a generalized model for CON due date assignment and sequencing, International Journal of Production Economics, 34, 179-185 (1994)</td> </tr><tr> <td>[52]</td> <td class="space">De, P.; Ghosh, J. B.; Wells, C. E., Due-date assignment and early/tardy scheduling on identical parallel machines, Naval Research Logistics, 41, 17-32 (1994) · <a href="/0794.90022" class="nowrap">Zbl 0794.90022</a></td> </tr><tr> <td>[53]</td> <td class="space">Della Croce, F.; Gupta, J. N.D.; Tadei, R., Minimizing tardy jobs in a flowshop with common due date, European Journal of Operational Research, 120, 375-381 (2000) · <a href="/0949.90040" class="nowrap">Zbl 0949.90040</a></td> </tr><tr> <td>[54]</td> <td class="space">Dickman, B.; Wilamowsky, Y.; Epstein, S., Optimal common due date with limited completion time, Computers and Operations Research, 18, 125-127 (1991) · <a href="/0716.90052" class="nowrap">Zbl 0716.90052</a></td> </tr><tr> <td>[55]</td> <td class="space">Dileepan, P., Common due date scheduling problem with separate earliness and tardiness penalties, Computers and Operations Research, 20, 179-181 (1993) · <a href="/0770.90033" class="nowrap">Zbl 0770.90033</a></td> </tr><tr> <td>[56]</td> <td class="space">Eilon, S.; Chowdhury, I. J., Due dates in job shop scheduling, International Journal of Production Research, 14, 223-237 (1976)</td> </tr><tr> <td>[57]</td> <td class="space">Emmons, H., Scheduling to a common due date on parallel uniform processors, Naval Research Logistics Quarterly, 34, 803-810 (1987) · <a href="/0648.90043" class="nowrap">Zbl 0648.90043</a></td> </tr><tr> <td>[58]</td> <td class="space">Federgruen, A.; Mosheiov, G., Simultaneous optimization of efficiency and performance balance measures in single-machine scheduling problems, Naval Research Logistics, 40, 951-970 (1993) · <a href="/0801.90060" class="nowrap">Zbl 0801.90060</a></td> </tr><tr> <td>[59]</td> <td class="space">Federgruen, A.; Mosheiov, G., Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs, Operations Research Letters, 16, 199-208 (1994) · <a href="/0823.90060" class="nowrap">Zbl 0823.90060</a></td> </tr><tr> <td>[60]</td> <td class="space">Feldmann, M., Biskup, D., 1999. Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristc approaches, University of Bielefeld Discussion Paper No. 425, 1-28; International Journal of Applied Intelligence, to appear; Feldmann, M., Biskup, D., 1999. Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristc approaches, University of Bielefeld Discussion Paper No. 425, 1-28; International Journal of Applied Intelligence, to appear</td> </tr><tr> <td>[61]</td> <td class="space">Garey, M. R.; Tarian, R. T.; Wilfong, G. T., One-processor scheduling with symmetric earliness and tardiness penalties, Mathematics of Operations Research, 13, 330-348 (1988) · <a href="/0671.90033" class="nowrap">Zbl 0671.90033</a></td> </tr><tr> <td>[62]</td> <td class="space">Gee, E. S.; Smith, C. H., Selecting allowance policies for improved job shop performance, International Journal of Production Research, 31, 1839-1852 (1993)</td> </tr><tr> <td>[63]</td> <td class="space">Gordon, V.S., Proth, J.-M., Chu, C., 1998. A state-of-the-art survey of due date assignment and scheduling research: SLK, TWK, and other due date assignment models. INRIA Rapport de Recherche 3537, 1-37; Production Planning and Control, to appear; Gordon, V.S., Proth, J.-M., Chu, C., 1998. A state-of-the-art survey of due date assignment and scheduling research: SLK, TWK, and other due date assignment models. INRIA Rapport de Recherche 3537, 1-37; Production Planning and Control, to appear</td> </tr><tr> <td>[64]</td> <td class="space">Gupta, M. C.; Gupta, Y. P.; Kumar, A., Minimizing flow time variance in a single machine system using genetic algorithms, European Journal of Operational Research, 70, 289-303 (1993) · <a href="/0784.90036" class="nowrap">Zbl 0784.90036</a></td> </tr><tr> <td>[65]</td> <td class="space">Gupta, S. K.; Kyparisis, J., Single machine scheduling research, OMEGA, 15, 207-227 (1987)</td> </tr><tr> <td>[66]</td> <td class="space">Gupta, Y. P.; Bector, C. R.; Gupta, M. C., Optimal schedule on a single machine using various due date determination methods, Computers in Industry, 15, 245-253 (1990)</td> </tr><tr> <td>[67]</td> <td class="space">Hall, N. G., Scheduling problems with generalized due dates, IIE Transactions, 18, 220-222 (1986)</td> </tr><tr> <td>[68]</td> <td class="space">Hall, N. G., Single- and multiple-processor models for minimizing completion time variance, Naval Research Logistics Quarterly, 33, 49-54 (1986) · <a href="/0599.90057" class="nowrap">Zbl 0599.90057</a></td> </tr><tr> <td>[69]</td> <td class="space">Hall, N. G.; Kubiak, W.; Sethi, S. P., Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date, Operations Research, 39, 847-856 (1991) · <a href="/0762.90037" class="nowrap">Zbl 0762.90037</a></td> </tr><tr> <td>[70]</td> <td class="space">Hall, N. G.; Posner, M. E., Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date, Operations Research, 39, 836-846 (1991) · <a href="/0749.90041" class="nowrap">Zbl 0749.90041</a></td> </tr><tr> <td>[71]</td> <td class="space">Hall, N. G.; Sethi, S. P.; Sriskandarajah, C., On the complexity of generalized due date scheduling problems, European Journal of Operational Research, 51, 100-109 (1991) · <a href="/0742.90043" class="nowrap">Zbl 0742.90043</a></td> </tr><tr> <td>[72]</td> <td class="space">Hao, Q.; Yang, Z.; Wang, D.; Li, Z., Common due date determination and sequencing using tabu search, Computers and Operations Research, 23, 409-417 (1996) · <a href="/0849.90078" class="nowrap">Zbl 0849.90078</a></td> </tr><tr> <td>[73]</td> <td class="space">Hardy, G. H.; Littlewood, J. E.; Polya, G., Inequalities (1934), Cambridge University Press: Cambridge University Press New York · <a href="/60.0169.01" class="nowrap">JFM 60.0169.01</a></td> </tr><tr> <td>[74]</td> <td class="space">Herrmann, J. W.; Lee, C.-Y., On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date, European Journal of Operational Research, 70, 272-288 (1993) · <a href="/0842.90060" class="nowrap">Zbl 0842.90060</a></td> </tr><tr> <td>[75]</td> <td class="space">Hoogeveen, J.A., Lenstra, J.K., van de Velde, S.L., 1997. Sequencing and scheduling: An annotated bibliography, Memorandum COSOR 97 - 02, Eindhoven University of Technology, pp. 1-17; Hoogeveen, J.A., Lenstra, J.K., van de Velde, S.L., 1997. Sequencing and scheduling: An annotated bibliography, Memorandum COSOR 97 - 02, Eindhoven University of Technology, pp. 1-17</td> </tr><tr> <td>[76]</td> <td class="space">Hoogeveen, J. A.; Oosterhout, H.; van de Velde, S. L., New lower and upper bounds for scheduling around a small common due date, Operations Research, 42, 102-110 (1994) · <a href="/0798.90085" class="nowrap">Zbl 0798.90085</a></td> </tr><tr> <td>[77]</td> <td class="space">Hoogeveen, J. A.; van de Velde, S. L., Scheduling around a small common due date, European Journal of Operational Research, 55, 237-242 (1991) · <a href="/0755.90044" class="nowrap">Zbl 0755.90044</a></td> </tr><tr> <td>[78]</td> <td class="space">Hoogeveen, J. A.; van de Velde, S. L., Earliness-tardiness scheduling around almost equal due date, INFORMS Journal on Computing, 9, 92-99 (1997) · <a href="/0889.90089" class="nowrap">Zbl 0889.90089</a></td> </tr><tr> <td>[79]</td> <td class="space">Jackson, J.R., 1955. Scheduling a production line to minimize maximum tardiness. Management Science Research Project, UCLA; Jackson, J.R., 1955. Scheduling a production line to minimize maximum tardiness. Management Science Research Project, UCLA</td> </tr><tr> <td>[80]</td> <td class="space">James, R. J.W., Using tabu search to solve the common due date early/tardy machine scheduling problem, Computers and Operations Research, 24, 199-208 (1997) · <a href="/0889.90090" class="nowrap">Zbl 0889.90090</a></td> </tr><tr> <td>[81]</td> <td class="space">Jozefowska, J.; Jurisch, B.; Kubiak, W., Scheduling shops to minimize the weighted number of late jobs, Operations Research Letters, 16, 277-283 (1994) · <a href="/0823.90061" class="nowrap">Zbl 0823.90061</a></td> </tr><tr> <td>[82]</td> <td class="space">Jurisch, B.; Kubiak, W.; Jozefowska, J., Algorithms for minclique scheduling problems, Discrete Applied Mathematics, 72, 115-139 (1997) · <a href="/0872.90048" class="nowrap">Zbl 0872.90048</a></td> </tr><tr> <td>[83]</td> <td class="space">Kahlbacher, H. G., SWEAT - a program for a scheduling problem with earliness and tardiness penalties, European Journal of Operational Research, 43, 111-112 (1989)</td> </tr><tr> <td>[84]</td> <td class="space">Kahlbacher, H. G., Scheduling with monotonous earliness and tardiness penalties, European Journal of Operational Research, 64, 258-277 (1993) · <a href="/0776.90036" class="nowrap">Zbl 0776.90036</a></td> </tr><tr> <td>[85]</td> <td class="space">Kahlbacher, H. G.; Cheng, T. C.E., Parallel machine scheduling to minimize costs for earliness and number of tardy jobs, Discrete Applied Mathematics, 47, 139-164 (1993) · <a href="/0816.90084" class="nowrap">Zbl 0816.90084</a></td> </tr><tr> <td>[86]</td> <td class="space">Kanet, J. J., Minimizing the average deviation of job completion times about a common due date, Naval Research Logistics Quarterly, 28, 643-651 (1981) · <a href="/0548.90037" class="nowrap">Zbl 0548.90037</a></td> </tr><tr> <td>[87]</td> <td class="space">Karacapilidis, N. I.; Pappis, C. P., Form similarities of the CON and SLK due date determination methods, Journal of the Operational Research Society, 46, 762-770 (1995) · <a href="/0832.90056" class="nowrap">Zbl 0832.90056</a></td> </tr><tr> <td>[88]</td> <td class="space">Karacapilidis, N. I.; Pappis, C. P., Optimization algorithms for a class of single machine scheduling problems using due date determination methods, Yugoslavian Journal of Operations Research, 5, 289-297 (1995) · <a href="/0860.90072" class="nowrap">Zbl 0860.90072</a></td> </tr><tr> <td>[89]</td> <td class="space">Kawaguchi, T.; Kyan, S., Deterministic scheduling in computer systems: A survey, Journal of the Operational Research Society of Japan, 31, 190-217 (1988) · <a href="/0644.68048" class="nowrap">Zbl 0644.68048</a></td> </tr><tr> <td>[90]</td> <td class="space">Koulamas, C., The total tardiness problem: Review and extensions, Operations Research, 42, 1025-1041 (1994) · <a href="/0824.90083" class="nowrap">Zbl 0824.90083</a></td> </tr><tr> <td>[91]</td> <td class="space">Kovalyov, M. Y., Batch scheduling and common due date assignment problem: An NP-hard case, Discrete Applied Mathematics, 80, 251-254 (1997) · <a href="/0894.68011" class="nowrap">Zbl 0894.68011</a></td> </tr><tr> <td>[92]</td> <td class="space">Kovalyov, M. Y.; Kubiak, W., A fully polynomial approximation scheme for the weighted earliness-tardiness problem, Operations Research, 47, 757-761 (1999) · <a href="/0976.90042" class="nowrap">Zbl 0976.90042</a></td> </tr><tr> <td>[93]</td> <td class="space">Kramer, F.-J.; Lee, C.-Y., Common due-window scheduling, Production and Operations Management, 2, 262-275 (1993)</td> </tr><tr> <td>[94]</td> <td class="space">Kubiak, W., Completion time variance minimization on a single machine is difficult, Operations Research Letters, 14, 49-59 (1993) · <a href="/0794.90024" class="nowrap">Zbl 0794.90024</a></td> </tr><tr> <td>[95]</td> <td class="space">Kubiak, W., New results on the completion time variance minimization, Discrete Applied Mathematics, 58, 157-168 (1995) · <a href="/0833.90070" class="nowrap">Zbl 0833.90070</a></td> </tr><tr> <td>[96]</td> <td class="space">Kubiak, W.; Lou, S.; Sethi, R., Equivalence of mean flow time problems and mean absolute deviation problems, Operations Research Letters, 9, 371-374 (1990) · <a href="/0825.90553" class="nowrap">Zbl 0825.90553</a></td> </tr><tr> <td>[97]</td> <td class="space">Lakshminarayan, S.; Lakshmanan, R.; Papineau, R. L.; Rochette, R., Optimal single-machine scheduling with earliness and tardiness penalties, Operations Research, 26, 1079-1082 (1978) · <a href="/0413.90031" class="nowrap">Zbl 0413.90031</a></td> </tr><tr> <td>[98]</td> <td class="space">Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., 1993. Sequencing and scheduling: Algorithms and complexity. In: Graves S.C., Zipkin P.H., Rinnooy Kan A.H.G. (Eds.), Logistics of Production and Inventory; Handbooks in Operations Research and Management Science, vol. 4, North-Holland, Amsterdam, pp. 445-522; Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., 1993. Sequencing and scheduling: Algorithms and complexity. In: Graves S.C., Zipkin P.H., Rinnooy Kan A.H.G. (Eds.), Logistics of Production and Inventory; Handbooks in Operations Research and Management Science, vol. 4, North-Holland, Amsterdam, pp. 445-522 · <a href="/0798.90028" class="nowrap">Zbl 0798.90028</a></td> </tr><tr> <td>[99]</td> <td class="space">Lawler, E. L.; Moore, J. M., A functional equation and its application to resource allocations and sequencing problems, Management Science, 16, 77-84 (1969) · <a href="/0184.23303" class="nowrap">Zbl 0184.23303</a></td> </tr><tr> <td>[100]</td> <td class="space">Lawrence, S. R., Estimating flowtimes and setting due-dates in complex production systems, IIE Transactions, 27, 657-668 (1995)</td> </tr><tr> <td>[101]</td> <td class="space">Lee, C.-Y.; Danusaputro, S. L.; Lin, C.-S., Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date, Computers and Operations Research, 18, 379-389 (1991) · <a href="/0717.90037" class="nowrap">Zbl 0717.90037</a></td> </tr><tr> <td>[102]</td> <td class="space">Lee, C.-Y.; Kim, S. J., Parallel genetic algorithms for the earliness tardiness job scheduling problem with general penalty weights, Computers and Industrial Engineering, 28, 231-243 (1995)</td> </tr><tr> <td>[103]</td> <td class="space">Li, C.-L.; Cheng, T. C.E., The parallel machine min-max weighted absolute lateness scheduling problem, Naval Research Logistics, 41, 33-46 (1994) · <a href="/0808.90082" class="nowrap">Zbl 0808.90082</a></td> </tr><tr> <td>[104]</td> <td class="space">Liman, S. D.; Panwalkar, S. S.; Thongmee, S., Determination of common due window location in a single machine scheduling problem, European Journal of Operational Research, 93, 68-74 (1996) · <a href="/0912.90176" class="nowrap">Zbl 0912.90176</a></td> </tr><tr> <td>[105]</td> <td class="space">Liman, S. D.; Panwalkar, S. S.; Thongmee, S., Common due window size and location determination in a single machine scheduling problem, Journal of the Operational Research Society, 49, 1007-1010 (1998) · <a href="/1140.90405" class="nowrap">Zbl 1140.90405</a></td> </tr><tr> <td>[106]</td> <td class="space">Merten, A. G.; Muller, M. E., Variance minimization in a single machine sequencing problems, Management Science, 18, 518-528 (1972) · <a href="/0254.90040" class="nowrap">Zbl 0254.90040</a></td> </tr><tr> <td>[107]</td> <td class="space">Monden, Y. 1983. Toyota Production Systems. Industrial Engineering and Management Press. Norcross, GA; Monden, Y. 1983. Toyota Production Systems. Industrial Engineering and Management Press. Norcross, GA</td> </tr><tr> <td>[108]</td> <td class="space">Morton, T. E.; Pentico, D. W., Heuristic Scheduling Systems (1993), Wiley: Wiley New York</td> </tr><tr> <td>[109]</td> <td class="space">Panwalkar, S. S.; Rajagopalan, R., Single machine sequencing with controllable processing times, European Journal of Operational Research, 59, 298-302 (1992) · <a href="/0760.90058" class="nowrap">Zbl 0760.90058</a></td> </tr><tr> <td>[110]</td> <td class="space">Panwalkar, S. S.; Smith, M. L.; Seidmann, A., Common due date assignment to minimize total penalty for the one machine scheduling problem, Operations Research, 30, 391-399 (1982) · <a href="/0481.90042" class="nowrap">Zbl 0481.90042</a></td> </tr><tr> <td>[111]</td> <td class="space">Pappis, C. P.; Adamopoulos, G. I., Scheduling under the due date criterion with varying penalties for lateness, Yugoslavian Journal of Operations Research, 3, 189-198 (1993) · <a href="/0804.90075" class="nowrap">Zbl 0804.90075</a></td> </tr><tr> <td>[112]</td> <td class="space">Philipoom, P. R.; Wiegmann, L.; Rees, L. P., Cost-based due-date assignment with the use of classical and neural-network approaches, Naval Research Logistics, 44, 21-46 (1997) · <a href="/0882.90073" class="nowrap">Zbl 0882.90073</a></td> </tr><tr> <td>[113]</td> <td class="space">Pinedo, M. L., Scheduling: Theory, Algorithms, and Systems (1995), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ · <a href="/1145.90393" class="nowrap">Zbl 1145.90393</a></td> </tr><tr> <td>[114]</td> <td class="space">Quaddus, M. A., A generalized model of optimal due-date assignment by linear programming, Journal of the Operational Research Society, 38, 353-359 (1987) · <a href="/0608.90045" class="nowrap">Zbl 0608.90045</a></td> </tr><tr> <td>[115]</td> <td class="space">Raghavachari, M., A V-shape property of optimal schedule of jobs about a common due date, European Journal of Operational Research, 23, 401-402 (1986) · <a href="/0584.90043" class="nowrap">Zbl 0584.90043</a></td> </tr><tr> <td>[116]</td> <td class="space">Raghavachari, M., Scheduling problems with non-regular penalty functions – a review, Operations Research, 25, 144-164 (1988) · <a href="/0649.90065" class="nowrap">Zbl 0649.90065</a></td> </tr><tr> <td>[117]</td> <td class="space">Ramasesh, R., Dynamic job shop scheduling: A survey of simulation research, OMEGA, 18, 43-57 (1990)</td> </tr><tr> <td>[118]</td> <td class="space">Roman, D. B.; Valle, A. G., Dynamic assignation of due-dates in an assembly shop based in simulation, International Journal of Production Research, 34, 1539-1554 (1996) · <a href="/0927.90039" class="nowrap">Zbl 0927.90039</a></td> </tr><tr> <td>[119]</td> <td class="space">Sarper, H., Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem, Applied Mathematics Modelling, 19, 153-161 (1995) · <a href="/0829.90075" class="nowrap">Zbl 0829.90075</a></td> </tr><tr> <td>[120]</td> <td class="space">Seidmann, A.; Panwalkar, S. S.; Smith, M. L., Optimal assignment of due-dates for a single processor scheduling problem, International Journal of Production Research, 19, 393-399 (1981) · <a href="/0481.90042" class="nowrap">Zbl 0481.90042</a></td> </tr><tr> <td>[121]</td> <td class="space">Sen, T.; Gupta, S. K., A state-of-art survey of static scheduling research involving due dates, OMEGA, 12, 63-76 (1984)</td> </tr><tr> <td>[122]</td> <td class="space">Smith, C. H.; Minor, E. D.; Wen, H. J., Regression-based due date assignment rules for improved assembly shop performance, International Journal of Production Research, 33, 2375-2385 (1995) · <a href="/0909.90182" class="nowrap">Zbl 0909.90182</a></td> </tr><tr> <td>[123]</td> <td class="space">Sundararaghavan, P. S.; Ahmed, M. U., Minimizing the sum of absolute lateness in single-machine and multimachine scheduling, Naval Research Logistics Quarterly, 31, 325-333 (1984) · <a href="/0544.90052" class="nowrap">Zbl 0544.90052</a></td> </tr><tr> <td>[124]</td> <td class="space">Szwarc, W., Single-machine scheduling to minimize absolute deviation of completion times from a common due date, Naval Research Logistics, 36, 663-673 (1989) · <a href="/0674.90049" class="nowrap">Zbl 0674.90049</a></td> </tr><tr> <td>[125]</td> <td class="space">Szwarc, W., The weighted common due date single machine scheduling problem revisited, Computers and Operations Research, 23, 255-262 (1996) · <a href="/0855.90072" class="nowrap">Zbl 0855.90072</a></td> </tr><tr> <td>[126]</td> <td class="space">Tanaev, V. S.; Gordon, V. S.; Shafransky, Y. M., Scheduling Theory: Single-Stage Systems (1994), Kluwer: Kluwer Dordrecht · <a href="/0827.90079" class="nowrap">Zbl 0827.90079</a></td> </tr><tr> <td>[127]</td> <td class="space">Tanaev, V. S.; Sotskov, Y. N.; Strusevich, V. A., Scheduling Theory: Multi-Stage Systems (1994), Kluwer: Kluwer Dordrecht · <a href="/0925.90224" class="nowrap">Zbl 0925.90224</a></td> </tr><tr> <td>[128]</td> <td class="space">Tsai, C.-H.; Chang, G.-T.; Li, R.-K., Integrating order release control with due-date assignment rules, International Journal of Production Research, 35, 3379-3392 (1997) · <a href="/0943.90512" class="nowrap">Zbl 0943.90512</a></td> </tr><tr> <td>[129]</td> <td class="space">Van den Akker, M., Hoogeveen, H., van de Velde, S., 2000. Combining column generation and Lagrangean relaxation: an application to a single-machine common due date scheduling problem. In: Brucker, P., Heitman, S., Hurink, J., Knust S. (Eds.), Seventh International Workshop on Project Management and Scheduling (PMS 2000). Exrended Abstracts, Osnabruck, pp. 35-38; Van den Akker, M., Hoogeveen, H., van de Velde, S., 2000. Combining column generation and Lagrangean relaxation: an application to a single-machine common due date scheduling problem. In: Brucker, P., Heitman, S., Hurink, J., Knust S. (Eds.), Seventh International Workshop on Project Management and Scheduling (PMS 2000). Exrended Abstracts, Osnabruck, pp. 35-38</td> </tr><tr> <td>[130]</td> <td class="space">Ventura, J. A.; Weng, M. X., An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date, Operations Research Letters, 17, 149-152 (1995) · <a href="/0842.90067" class="nowrap">Zbl 0842.90067</a></td> </tr><tr> <td>[131]</td> <td class="space">Vig, M. M.; Dooley, K. J., Dynamic rules for due date assignments, International Journal of Production Research, 29, 1361-1377 (1991)</td> </tr><tr> <td>[132]</td> <td class="space">Vig, M. M.; Dooley, K. J., Mixing static and dynamic flowtime estimates for due-date assignment, Journal of Operations Management, 11, 67-79 (1993)</td> </tr><tr> <td>[133]</td> <td class="space">Weeks, J. K.; Fryer, J. S., A methodology for assigning minimum cost due-dates, Management Science, 23, 872-881 (1979)</td> </tr><tr> <td>[134]</td> <td class="space">Webster, S. T., The complexity of scheduling job families about a common due date, Operations Research Letters, 20, 65-74 (1997) · <a href="/0890.90111" class="nowrap">Zbl 0890.90111</a></td> </tr><tr> <td>[135]</td> <td class="space">Weng, M. X.; Ventura, J. A., Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times, Naval Research Logistics Quarterly, 41, 843-851 (1994) · <a href="/0827.90080" class="nowrap">Zbl 0827.90080</a></td> </tr><tr> <td>[136]</td> <td class="space">Wilamowsky, Y.; Epstein, S.; Dickman, B., Optimal common due-date completion time tolerance, Computers and Operations Research, 23, 1203-1210 (1996) · <a href="/0873.90057" class="nowrap">Zbl 0873.90057</a></td> </tr><tr> <td>[137]</td> <td class="space">Yeung, W. K.; Oguz, C.; Cheng, T. C.E., Single-machine scheduling with a common due window, Computers and Operations Research, 28, 157-175 (2001) · <a href="/0990.90050" class="nowrap">Zbl 0990.90050</a></td> </tr></table> <div class="reference_disclaimer"> This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching. </div> </div></article> </div></div> </div> </div> <div class="clearfix"></div> </div> </div> <div id="foot"><div class="copyright"> © 2025 <a target="fiz" href="https://www.fiz-karlsruhe.de/en">FIZ Karlsruhe GmbH</a> <a href="/privacy-policy/">Privacy Policy</a> <a href="/legal-notices/">Legal Notices</a> <a href="/terms-conditions/">Terms & Conditions</a> <div class="info"> <ul class="nav"> <li class="mastodon"> <a href="https://mathstodon.xyz/@zbMATH" target="_blank" class="no-new-tab-icon"> <img src="/static/mastodon.png" title="zbMATH at Mathstodon (opens in new tab)" alt="Mastodon logo"> </a> </li> </ul> </div> </div> <div class="clearfix" style="height: 0px;"></div> </div> </div> <script src="https://static.zbmath.org/contrib/jquery/1.9.1/jquery.min.js"></script> <script src="https://static.zbmath.org/contrib/jquery-caret/1.5.2/jquery.caret.min.js"></script> <script src="/static/js/jquery-ui-1.10.1.custom.min.js"></script> <script src="https://static.zbmath.org/contrib/bootstrap/v3.3.7zb1/js/bootstrap.min.js"></script> <script src="https://static.zbmath.org/contrib/bootstrap-lightbox/v0.7.0/bootstrap-lightbox.min.js"></script> <script src="https://static.zbmath.org/contrib/retina/unknown/retina.js"></script> <script src="https://static.zbmath.org/contrib/bootstrap-select/v1.13.14/js/bootstrap-select.min.js"></script> <script> var SCRIPT_ROOT = ""; </script> <script src="/static/scripts.js?v=20240926"> </script> <script src="https://static.zbmath.org/contrib/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script> <script type="text/x-mathjax-config"> MathJax.Hub.Config({ "HTML-CSS": { preferredFont: "TeX", availableFonts: [ "STIX", "TeX" ], linebreaks: { automatic: true }, EqnChunk: (MathJax.Hub.Browser.isMobile ? 10 : 50) }, tex2jax: { processEscapes: true, ignoreClass: "tex2jax_ignore|dno" }, TeX: { Macros: { Aut: "\\operatorname{Aut}", Hom: "\\operatorname{Hom}" }, noUndefined: { attributes: { mathcolor: "#039", //"red", mathbackground: "white", //"#FFEEEE", mathsize: "90%" } } }, messageStyle: "none" }); </script> <script type="text/javascript"> $(document).ready(function() { $("#MathInput").stop(true, true).keyup(function() { $.ajax({ url: "/mwsq/", type: "POST", data: { query : $("#MathInput").val() }, dataType: "text" }) .done(function(xml) { $("#MathPreview").html(xml); $(window).resize(); }); }); var press = jQuery.Event("keyup"); press.ctrlKey = false; press.which = 40; $("#MathInput").trigger(press); }); </script> <div id="new_tab_icon" style="display: none"> <span class="glyphicon glyphicon-new-window" aria-hidden="true"></span><span class="sr-only">(opens in new tab)</span></div> </body> </html>

CINXE.COM

Document Zbl 1009.90054 - zbMATH Open