CINXE.COM

<!DOCTYPE html> <html lang="en" xmlns:fb="http://www.facebook.com/2008/fbml" class="wf-loading"> <head prefix="og: https://ogp.me/ns# fb: https://ogp.me/ns/fb# academia: https://ogp.me/ns/fb/academia#"> <meta charset="utf-8"> <meta name=viewport content="width=device-width"> <meta rel="search" type="application/opensearchdescription+xml" href="/open_search.xml" title="Academia.edu"> <title>Erasmus University Rotterdam | Institutd of Health Policy and Management - Academia.edu</title>  <link href="//a.academia-assets.com/images/favicons/favicon-production.ico" rel="shortcut icon" type="image/vnd.microsoft.icon"> <link rel="apple-touch-icon" sizes="57x57" href="//a.academia-assets.com/images/favicons/apple-touch-icon-57x57.png"> <link rel="apple-touch-icon" sizes="60x60" href="//a.academia-assets.com/images/favicons/apple-touch-icon-60x60.png"> <link rel="apple-touch-icon" sizes="72x72" href="//a.academia-assets.com/images/favicons/apple-touch-icon-72x72.png"> <link rel="apple-touch-icon" sizes="76x76" href="//a.academia-assets.com/images/favicons/apple-touch-icon-76x76.png"> <link rel="apple-touch-icon" sizes="114x114" href="//a.academia-assets.com/images/favicons/apple-touch-icon-114x114.png"> <link rel="apple-touch-icon" sizes="120x120" href="//a.academia-assets.com/images/favicons/apple-touch-icon-120x120.png"> <link rel="apple-touch-icon" sizes="144x144" href="//a.academia-assets.com/images/favicons/apple-touch-icon-144x144.png"> <link rel="apple-touch-icon" sizes="152x152" href="//a.academia-assets.com/images/favicons/apple-touch-icon-152x152.png"> <link rel="apple-touch-icon" sizes="180x180" href="//a.academia-assets.com/images/favicons/apple-touch-icon-180x180.png"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-32x32.png" sizes="32x32"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-194x194.png" sizes="194x194"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-96x96.png" sizes="96x96"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/android-chrome-192x192.png" sizes="192x192"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-16x16.png" sizes="16x16"> <link rel="manifest" href="//a.academia-assets.com/images/favicons/manifest.json"> <meta name="msapplication-TileColor" content="#2b5797"> <meta name="msapplication-TileImage" content="//a.academia-assets.com/images/favicons/mstile-144x144.png"> <meta name="theme-color" content="#ffffff"> <script> window.performance && window.performance.measure && window.performance.measure("Time To First Byte", "requestStart", "responseStart"); </script> <script> (function() { if (!window.URLSearchParams || !window.history || !window.history.replaceState) { return; } var searchParams = new URLSearchParams(window.location.search); var paramsToDelete = [ 'fs', 'sm', 'swp', 'iid', 'nbs', 'rcc', // related content category 'rcpos', // related content carousel position 'rcpg', // related carousel page 'rchid', // related content hit id 'f_ri', // research interest id, for SEO tracking 'f_fri', // featured research interest, for SEO tracking (param key without value) 'f_rid', // from research interest directory for SEO tracking 'f_loswp', // from research interest pills on LOSWP sidebar for SEO tracking 'rhid', // referrring hit id ]; if (paramsToDelete.every((key) => searchParams.get(key) === null)) { return; } paramsToDelete.forEach((key) => { searchParams.delete(key); }); var cleanUrl = new URL(window.location.href); cleanUrl.search = searchParams.toString(); history.replaceState({}, document.title, cleanUrl); })(); </script> <script async src="https://www.googletagmanager.com/gtag/js?id=G-5VKX33P2DS"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-5VKX33P2DS', { cookie_domain: 'academia.edu', send_page_view: false, }); gtag('event', 'page_view', { 'controller': "departments", 'action': "show_works", 'controller_action': 'departments#show_works', 'logged_in': 'false', 'edge': 'unknown', // Send nil if there is no A/B test bucket, in case some records get logged // with missing data - that way we can distinguish between the two cases. // ab_test_bucket should be of the form <ab_test_name>:<bucket> 'ab_test_bucket': null, }) </script> <script type="text/javascript"> window.sendUserTiming = function(timingName) { if (!(window.performance && window.performance.measure)) return; var entries = window.performance.getEntriesByName(timingName, "measure"); if (entries.length !== 1) return; var timingValue = Math.round(entries[0].duration); gtag('event', 'timing_complete', { name: timingName, value: timingValue, event_category: 'User-centric', }); }; window.sendUserTiming("Time To First Byte"); </script> <meta name="csrf-param" content="authenticity_token" /> <meta name="csrf-token" content="upONU3LOSd0JdZUnQzlIKzLtcLLFbTyZ6AaWfF5au96_vON0CesvfR8K-yGWHjFgFz8p4p5bKCB7k5eqj70T3g" /> <link crossorigin="" href="https://fonts.gstatic.com/" rel="preconnect" /><link href="https://fonts.googleapis.com/css2?family=DM+Sans:ital,opsz,wght@0,9..40,100..1000;1,9..40,100..1000&family=Gupter:wght@400;500;700&family=IBM+Plex+Mono:wght@300;400&family=Material+Symbols+Outlined:opsz,wght,FILL,GRAD@20,400,0,0&display=swap" rel="stylesheet" /><link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system/common-2b6f90dbd75f5941bc38f4ad716615f3ac449e7398313bb3bc225fba451cd9fa.css" /> <meta name="description" content="Academia.edu is the platform to share, find, and explore 50 Million research papers. Join us to accelerate your research needs & academic interests." /> <meta name="google-site-verification" content="bKJMBZA7E43xhDOopFZkssMMkBRjvYERV-NaN4R6mrs" /> <script> var $controller_name = 'departments'; var $action_name = "show_works"; var $rails_env = 'production'; var $app_rev = '1363409c2f6920b9f6129801bf9c25a45dc9d4a3'; var $domain = 'academia.edu'; var $app_host = "academia.edu"; var $asset_host = "academia-assets.com"; var $start_time = new Date().getTime(); var $recaptcha_key = "6LdxlRMTAAAAADnu_zyLhLg0YF9uACwz78shpjJB"; var $recaptcha_invisible_key = "6Lf3KHUUAAAAACggoMpmGJdQDtiyrjVlvGJ6BbAj"; var $disableClientRecordHit = false; </script> <script> window.Aedu = { hit_data: null }; window.Aedu.SiteStats = {"premium_universities_count":14023,"monthly_visitors":"102 million","monthly_visitor_count":102584291,"monthly_visitor_count_in_millions":102,"user_count":283362148,"paper_count":55203019,"paper_count_in_millions":55,"page_count":432000000,"page_count_in_millions":432,"pdf_count":16500000,"pdf_count_in_millions":16}; window.Aedu.serverRenderTime = new Date(1740150968000); window.Aedu.timeDifference = new Date().getTime() - 1740150968000; window.Aedu.isUsingCssV1 = false; window.Aedu.enableLocalization = true; window.Aedu.activateFullstory = false; window.Aedu.serviceAvailability = { status: {"attention_db":"on","bibliography_db":"on","contacts_db":"on","email_db":"on","indexability_db":"on","mentions_db":"on","news_db":"on","notifications_db":"on","offsite_mentions_db":"on","redshift":"on","redshift_exports_db":"on","related_works_db":"on","ring_db":"on","user_tests_db":"on"}, serviceEnabled: function(service) { return this.status[service] === "on"; }, readEnabled: function(service) { return this.serviceEnabled(service) || this.status[service] === "read_only"; }, }; window.Aedu.viewApmTrace = function() { // Check if x-apm-trace-id meta tag is set, and open the trace in APM // in a new window if it is. var apmTraceId = document.head.querySelector('meta[name="x-apm-trace-id"]'); if (apmTraceId) { var traceId = apmTraceId.content; // Use trace ID to construct URL, an example URL looks like: // https://app.datadoghq.com/apm/traces?query=trace_id%31298410148923562634 var apmUrl = 'https://app.datadoghq.com/apm/traces?query=trace_id%3A' + traceId; window.open(apmUrl, '_blank'); } }; </script>  <link href="https://fonts.googleapis.com/css?family=Roboto:100,100i,300,300i,400,400i,500,500i,700,700i,900,900i" rel="stylesheet"> <link rel="preload" href="//maxcdn.bootstrapcdn.com/font-awesome/4.3.0/css/font-awesome.min.css" as="style" onload="this.rel='stylesheet'"> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/libraries-a9675dcb01ec4ef6aa807ba772c7a5a00c1820d3ff661c1038a20f80d06bb4e4.css" /> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/academia-1eb081e01ca8bc0c1b1d866df79d9eb4dd2c484e4beecf76e79a7806c72fee08.css" /> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system_legacy-056a9113b9a0f5343d013b29ee1929d5a18be35fdcdceb616600b4db8bd20054.css" /> <script src="//a.academia-assets.com/assets/webpack_bundles/runtime-bundle-005434038af4252ca37c527588411a3d6a0eabb5f727fac83f8bbe7fd88d93bb.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/webpack_libraries_and_infrequently_changed.wjs-bundle-b42d48e01e9cb3bf5ae55ea154ab7133fe47240c1d7c59b0249065c67d6f65ab.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/core_webpack.wjs-bundle-f3fdf92d2e211a3fd7a717a75adb7bf4af30f5d7651964d9f223129f218112cd.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/sentry.wjs-bundle-5fe03fddca915c8ba0f7edbe64c194308e8ce5abaed7bffe1255ff37549c4808.js"></script> <script> jade = window.jade || {}; jade.helpers = window.$h; jade._ = window._; </script>  <script id="tag-manager-head-root">(function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start': new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0], j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src= 'https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f); })(window,document,'script','dataLayer_old','GTM-5G9JF7Z');</script>  <script> window.gptadslots = []; window.googletag = window.googletag || {}; window.googletag.cmd = window.googletag.cmd || []; </script> <script type="text/javascript"> // TODO(jacob): This should be defined, may be rare load order problem. // Checking if null is just a quick fix, will default to en if unset. // Better fix is to run this immedietely after I18n is set. if (window.I18n != null) { I18n.defaultLocale = "en"; I18n.locale = "en"; I18n.fallbacks = true; } </script> <link rel="canonical" href="https://eur.academia.edu/Departments/Institutd_of_Health_Policy_and_Management/Documents" /> </head>   <body class='c-departments a-show_works logged_out u-bgColorWhite'>  <div id="fb-root"></div><script>window.fbAsyncInit = function() { FB.init({ appId: "2369844204", version: "v8.0", status: true, cookie: true, xfbml: true }); // Additional initialization code. if (window.InitFacebook) { // facebook.ts already loaded, set it up. window.InitFacebook(); } else { // Set a flag for facebook.ts to find when it loads. window.academiaAuthReadyFacebook = true; } };</script><script>window.fbAsyncLoad = function() { // Protection against double calling of this function if (window.FB) { return; } (function(d, s, id){ var js, fjs = d.getElementsByTagName(s)[0]; if (d.getElementById(id)) {return;} js = d.createElement(s); js.id = id; js.src = "//connect.facebook.net/en_US/sdk.js"; fjs.parentNode.insertBefore(js, fjs); }(document, 'script', 'facebook-jssdk')); } if (!window.defer_facebook) { // Autoload if not deferred window.fbAsyncLoad(); } else { // Defer loading by 5 seconds setTimeout(function() { window.fbAsyncLoad(); }, 5000); }</script> <div id="google-root"></div><script>window.loadGoogle = function() { if (window.InitGoogle) { // google.ts already loaded, set it up. window.InitGoogle("331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b"); } else { // Set a flag for google.ts to use when it loads. window.GoogleClientID = "331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b"; } };</script><script>window.googleAsyncLoad = function() { // Protection against double calling of this function (function(d) { var js; var id = 'google-jssdk'; var ref = d.getElementsByTagName('script')[0]; if (d.getElementById(id)) { return; } js = d.createElement('script'); js.id = id; js.async = true; js.onload = loadGoogle; js.src = "https://accounts.google.com/gsi/client" ref.parentNode.insertBefore(js, ref); }(document)); } if (!window.defer_google) { // Autoload if not deferred window.googleAsyncLoad(); } else { // Defer loading by 5 seconds setTimeout(function() { window.googleAsyncLoad(); }, 5000); }</script> <div id="tag-manager-body-root">  <noscript><iframe src="https://www.googletagmanager.com/ns.html?id=GTM-5G9JF7Z" height="0" width="0" style="display:none;visibility:hidden"></iframe></noscript>   <script> window.addEventListener('load', function() { if (document.querySelector('input[name="commit"]')) { document.querySelector('input[name="commit"]').addEventListener('click', function() { gtag('event', 'click', { event_category: 'button', event_label: 'Log In' }) }) } }); </script> </div> <script>var _comscore = _comscore || []; _comscore.push({ c1: "2", c2: "26766707" }); (function() { var s = document.createElement("script"), el = document.getElementsByTagName("script")[0]; s.async = true; s.src = (document.location.protocol == "https:" ? "https://sb" : "http://b") + ".scorecardresearch.com/beacon.js"; el.parentNode.insertBefore(s, el); })();</script><img src="https://sb.scorecardresearch.com/p?c1=2&c2=26766707&cv=2.0&cj=1" style="position: absolute; visibility: hidden" /> <div id='react-modal'></div> <div class='DesignSystem'> <a class='u-showOnFocus' href='#site'> Skip to main content </a> </div> <div id="upgrade_ie_banner" style="display: none;"><p>Academia.edu no longer supports Internet Explorer.</p><p>To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to <a href="https://www.academia.edu/upgrade-browser">upgrade your browser</a>.</p></div><script>// Show this banner for all versions of IE if (!!window.MSInputMethodContext || /(MSIE)/.test(navigator.userAgent)) { document.getElementById('upgrade_ie_banner').style.display = 'block'; }</script> <div class="DesignSystem bootstrap ShrinkableNav no-xs no-sm no-md"><div class="navbar navbar-default main-header"><div class="container-wrapper" id="main-header-container"><div class="container"><div class="navbar-header"><div class="nav-left-wrapper u-mt0x"><div class="nav-logo"><a data-main-header-link-target="logo_home" href="https://www.academia.edu/"><img class="visible-xs-inline-block" style="height: 24px;" alt="Academia.edu" src="//a.academia-assets.com/images/academia-logo-redesign-2015-A.svg" width="24" height="24" /><img width="145.2" height="18" class="hidden-xs" style="height: 24px;" alt="Academia.edu" src="//a.academia-assets.com/images/academia-logo-redesign-2015.svg" /></a></div><div class="nav-search"><div class="SiteSearch-wrapper select2-no-default-pills"><form class="js-SiteSearch-form DesignSystem" action="https://www.academia.edu/search" accept-charset="UTF-8" method="get"><i class="SiteSearch-icon fa fa-search u-fw700 u-positionAbsolute u-tcGrayDark"></i><input class="js-SiteSearch-form-input SiteSearch-form-input form-control" data-main-header-click-target="search_input" name="q" placeholder="Search" type="text" value="" /></form></div></div></div><div class="nav-right-wrapper pull-right"><ul class="NavLinks js-main-nav list-unstyled"><li class="NavLinks-link"><a class="js-header-login-url Button Button--inverseGray Button--sm u-mb4x" id="nav_log_in" rel="nofollow" href="https://www.academia.edu/login">Log In</a></li><li class="NavLinks-link u-p0x"><a class="Button Button--inverseGray Button--sm u-mb4x" rel="nofollow" href="https://www.academia.edu/signup">Sign Up</a></li></ul><button class="hidden-lg hidden-md hidden-sm u-ml4x navbar-toggle collapsed" data-target=".js-mobile-header-links" data-toggle="collapse" type="button"><span class="icon-bar"></span><span class="icon-bar"></span><span class="icon-bar"></span></button></div></div><div class="collapse navbar-collapse js-mobile-header-links"><ul class="nav navbar-nav"><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/login">Log In</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/signup">Sign Up</a></li><li class="u-borderColorGrayLight u-borderBottom1 js-mobile-nav-expand-trigger"><a href="#">more&nbsp<span class="caret"></span></a></li><li><ul class="js-mobile-nav-expand-section nav navbar-nav u-m0x collapse"><li class="u-borderColorGrayLight u-borderBottom1"><a rel="false" href="https://www.academia.edu/about">About</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/press">Press</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="false" href="https://www.academia.edu/documents">Papers</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/terms">Terms</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/privacy">Privacy</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/copyright">Copyright</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/hiring"><i class="fa fa-briefcase"></i> We're Hiring!</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://support.academia.edu/hc/en-us"><i class="fa fa-question-circle"></i> Help Center</a></li><li class="js-mobile-nav-collapse-trigger u-borderColorGrayLight u-borderBottom1 dropup" style="display:none"><a href="#">less&nbsp<span class="caret"></span></a></li></ul></li></ul></div></div></div><script>(function(){ var $moreLink = $(".js-mobile-nav-expand-trigger"); var $lessLink = $(".js-mobile-nav-collapse-trigger"); var $section = $('.js-mobile-nav-expand-section'); $moreLink.click(function(ev){ ev.preventDefault(); $moreLink.hide(); $lessLink.show(); $section.collapse('show'); }); $lessLink.click(function(ev){ ev.preventDefault(); $moreLink.show(); $lessLink.hide(); $section.collapse('hide'); }); })() if ($a.is_logged_in() || false) { new Aedu.NavigationController({ el: '.js-main-nav', showHighlightedNotification: false }); } else { $(".js-header-login-url").attr("href", $a.loginUrlWithRedirect()); } Aedu.autocompleteSearch = new AutocompleteSearch({el: '.js-SiteSearch-form'});</script></div></div> <div id='site' class='fixed'> <div id="content" class="clearfix"> <script>document.addEventListener('DOMContentLoaded', function(){ var $dismissible = $(".dismissible_banner"); $dismissible.click(function(ev) { $dismissible.hide(); }); });</script> <div class="DesignSystem" style="margin-top:-40px"><div class="PageHeader"><div class="container"><div class="row"><div class="col-xs-12 clearfix"><div class="u-floatLeft u-fs24 u-tcGrayDarkest"><span class="PageHeader-title u-m0x u-fw700 u-mr5x u-pr5x u-borderColorGrayLight u-borderRight1"><a href="https://eur.academia.edu/"><span class="u-linkUnstyled u-tcGrayDarkest">Erasmus University Rotterdam</span></a></span><h1 class="u-m0x u-fw300 u-fs24 u-displayInline">Institutd of Health Policy and Management</h1></div><div class="u-floatRight u-mt1x"></div></div></div></div></div><div class="TabbedNavigation"><div class="container"><div class="row"><div class="col-xs-12 clearfix"><ul class="nav u-m0x u-p0x list-inline"><li class="u-floatLeft u-pr5x u-mr5x u-borderColorGrayLight u-borderRight1"><a href="https://eur.academia.edu/"><span><i class="fa fa-arrow-left"></i>  All Departments</span></a></li><li class="u-floatLeft active"><a href="https://eur.academia.edu/Departments/Institutd_of_Health_Policy_and_Management/Documents">46 Papers</a></li><li class="u-floatLeft"><a href="https://eur.academia.edu/Departments/Institutd_of_Health_Policy_and_Management">2 Researchers</a></li></ul></div></div></div></div><div class="container"><div class="row"><div class="col-xs-12"><div class="u-displayFlex"><div class="u-flexGrow1"><div class="u-ph0x"><div class="works"><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19502089 coauthored" data-work_id="19502089" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19502089/Production_planning_problems_in_printed_circuit_board_assembly">Production planning problems in printed circuit board assembly</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">This survey describes some of the main optimization problems arising in the context of production planning for the assembly of printed circuit boards. The discussion is structured around a hierarchical decomposition of the planning... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19502089" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">This survey describes some of the main optimization problems arising in the context of production planning for the assembly of printed circuit boards. The discussion is structured around a hierarchical decomposition of the planning process into distinct optimization subproblems, addressing issues such as the assignment of board types to machine groups, the allocation of component feeders to individual machines, the determination of optimal production sequences, etc. The paper reviews the literature on this topic with an emphasis on the most recent developments, on the fundamental structure of the mathematical models and on the relation between these models and some 'environmental' variables such as the layout of the shop or the product mix. ?</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19502089" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="f4d725faf13a5fbab5a8b370150ae2f5" rel="nofollow" data-download="{"attachment_id":40656029,"asset_id":19502089,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/40656029/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40651073" href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a><script data-card-contents-for-user="40651073" type="text/json">{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-19502089">+1</span><div class="hidden js-additional-users-19502089"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://kuleuven.academia.edu/FritsSpieksma">Frits Spieksma</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-19502089'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-19502089').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_19502089 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19502089"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19502089, container: ".js-paper-rank-work_19502089", }); });</script></li><li class="js-percentile-work_19502089 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19502089; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19502089"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19502089 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19502089"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19502089; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19502089]").text(description); $(".js-view-count-work_19502089").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19502089").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19502089"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="305" rel="nofollow" href="https://www.academia.edu/Documents/in/Applied_Mathematics">Applied Mathematics</a>, <script data-card-contents-for-ri="305" type="text/json">{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="20202" rel="nofollow" href="https://www.academia.edu/Documents/in/Production_Planning">Production Planning</a>, <script data-card-contents-for-ri="20202" type="text/json">{"id":20202,"name":"Production Planning","url":"https://www.academia.edu/Documents/in/Production_Planning","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="46254" rel="nofollow" href="https://www.academia.edu/Documents/in/Optimization_Problem">Optimization Problem</a>, <script data-card-contents-for-ri="46254" type="text/json">{"id":46254,"name":"Optimization Problem","url":"https://www.academia.edu/Documents/in/Optimization_Problem","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="89056" rel="nofollow" href="https://www.academia.edu/Documents/in/Printed_Circuit_Board">Printed Circuit Board</a><script data-card-contents-for-ri="89056" type="text/json">{"id":89056,"name":"Printed Circuit Board","url":"https://www.academia.edu/Documents/in/Printed_Circuit_Board","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19502089]'), work: {"id":19502089,"title":"Production planning problems in printed circuit board assembly","created_at":"2015-12-05T07:34:50.304-08:00","owner_id":34313351,"url":"https://www.academia.edu/19502089/Production_planning_problems_in_printed_circuit_board_assembly","slug":"Production_planning_problems_in_printed_circuit_board_assembly","dom_id":"work_19502089","summary":"This survey describes some of the main optimization problems arising in the context of production planning for the assembly of printed circuit boards. The discussion is structured around a hierarchical decomposition of the planning process into distinct optimization subproblems, addressing issues such as the assignment of board types to machine groups, the allocation of component feeders to individual machines, the determination of optimal production sequences, etc. The paper reviews the literature on this topic with an emphasis on the most recent developments, on the fundamental structure of the mathematical models and on the relation between these models and some 'environmental' variables such as the layout of the shop or the product mix. ?","publication":"Discrete Applied Mathematics","publication_with_fallback":"Discrete Applied Mathematics","downloadable_attachments":[{"id":40656029,"asset_id":19502089,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40656029/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40656029/Production_planning_problems_in_printed_20151205-18229-1xghgl0-libre.pdf?1449330100=\u0026response-content-disposition=attachment%3B+filename%3DProduction_planning_problems_in_printed.pdf\u0026Expires=1740040010\u0026Signature=LaK7ruAX5PQvQ3x39iuf32tphyvo5H3~87sp1ceeRw-AiCXqBQVGiCcq~uAHdEKvQzxhsnrzQxYYhfHpgf8~VxqDdSSSUjw4HXiu2Cqoh6015m1Q-tWjOVdrayKHGPA-WOm-0DNjNOAIfWYclfYJX9vVJ3TsxGjbUxcrL7XcBnn2eDnxMkY5tSK4OrgXBz1lRoGWSEmmSF5ks8JN8uyvXR4GKq2IdesVvXXjx90eoljkxjgwkYgYLmMJ-tI5Kq8Rijv2-biWE-0jUDb4X0WSliDX1tAipm8sr74NiI7er7IqZSJ2XWyXdqhezAd4-rCFCtipRB~f16et8e578m5nCw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40656029/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40656029/mini_magick20190220-11874-1kv4wow.png?1550707065"}],"downloadable_attachments_with_full_thumbnails":[{"id":40656029,"asset_id":19502089,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40656029/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40656029/Production_planning_problems_in_printed_20151205-18229-1xghgl0-libre.pdf?1449330100=\u0026response-content-disposition=attachment%3B+filename%3DProduction_planning_problems_in_printed.pdf\u0026Expires=1740040010\u0026Signature=LaK7ruAX5PQvQ3x39iuf32tphyvo5H3~87sp1ceeRw-AiCXqBQVGiCcq~uAHdEKvQzxhsnrzQxYYhfHpgf8~VxqDdSSSUjw4HXiu2Cqoh6015m1Q-tWjOVdrayKHGPA-WOm-0DNjNOAIfWYclfYJX9vVJ3TsxGjbUxcrL7XcBnn2eDnxMkY5tSK4OrgXBz1lRoGWSEmmSF5ks8JN8uyvXR4GKq2IdesVvXXjx90eoljkxjgwkYgYLmMJ-tI5Kq8Rijv2-biWE-0jUDb4X0WSliDX1tAipm8sr74NiI7er7IqZSJ2XWyXdqhezAd4-rCFCtipRB~f16et8e578m5nCw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40656029/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40656029/mini_magick20190220-11874-1kv4wow.png?1550707065"}],"has_pdf":true,"has_fulltext":true,"page_count":23,"ordered_authors":[{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"},{"id":34313351,"first_name":"Frits","last_name":"Spieksma","domain_name":"kuleuven","page_name":"FritsSpieksma","display_name":"Frits Spieksma","profile_url":"https://kuleuven.academia.edu/FritsSpieksma","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics","nofollow":true},{"id":20202,"name":"Production Planning","url":"https://www.academia.edu/Documents/in/Production_Planning","nofollow":true},{"id":46254,"name":"Optimization Problem","url":"https://www.academia.edu/Documents/in/Optimization_Problem","nofollow":true},{"id":89056,"name":"Printed Circuit Board","url":"https://www.academia.edu/Documents/in/Printed_Circuit_Board","nofollow":true},{"id":156545,"name":"Environmental Variables","url":"https://www.academia.edu/Documents/in/Environmental_Variables"},{"id":291387,"name":"Mathematical Model","url":"https://www.academia.edu/Documents/in/Mathematical_Model"},{"id":1172727,"name":"Discrete Applied Mathematics","url":"https://www.academia.edu/Documents/in/Discrete_Applied_Mathematics"},{"id":1300559,"name":"Integer Program","url":"https://www.academia.edu/Documents/in/Integer_Program"},{"id":1948411,"name":"Printed circuit board assembly","url":"https://www.academia.edu/Documents/in/Printed_circuit_board_assembly"}],"publication_year":2002,"publication_year_with_fallback":2002,"paper_rank":null,"all_time_views":104,"active_discussion":{}}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19502092 coauthored" data-work_id="19502092" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19502092/Exact_algorithms_for_procurement_problems_under_a_total_quantity_discount_structure">Exact algorithms for procurement problems under a total quantity discount structure</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This policy implies that every supplier announces a number of... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19502092" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This policy implies that every supplier announces a number of volume intervals and that the volume interval in which the total amount ordered lies determines the discount. Moreover, the discounted prices apply to all goods bought from the supplier, not only to those goods exceeding the volume threshold. We refer to this cost-minimization problem as the TQD problem. We give a mathematical formulation for this problem and argue that not only it is NP-hard, but also that there exists no polynomial-time approximation algorithm with a constant ratio (unless P = N P ). Apart from the basic form of the TQD problem, we describe three variants. In a first variant, the market share that one or more suppliers can obtain is constrained. Another variant allows the buyer to procure more goods than strictly needed, in order to reach a lower total cost. In a third variant, the number of winning suppliers is limited. We show that the TQD problem and its variants can be solved by solving a series of min-cost flow problems. Finally, we investigate the performance of three exact algorithms (min-cost flow based branch-and-bound, linear programming based branch-and-bound, and branch-and-cut) on randomly generated instances involving 50 suppliers and 100 goods. It turns out that even the large instances of the basic problem are solved to optimality within a limited amount of time. However, we find that different algorithms perform best in terms of computation time for different variants.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19502092" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="0aec53468ce5563ee3a3e7ed2f375159" rel="nofollow" data-download="{"attachment_id":40655984,"asset_id":19502092,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/40655984/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="34313351" href="https://kuleuven.academia.edu/FritsSpieksma">Frits Spieksma</a><script data-card-contents-for-user="34313351" type="text/json">{"id":34313351,"first_name":"Frits","last_name":"Spieksma","domain_name":"kuleuven","page_name":"FritsSpieksma","display_name":"Frits Spieksma","profile_url":"https://kuleuven.academia.edu/FritsSpieksma","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-19502092">+2</span><div class="hidden js-additional-users-19502092"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://ugent.academia.edu/DriesGoossens">Dries Goossens</a></span></div><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-19502092'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-19502092').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_19502092 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19502092"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19502092, container: ".js-paper-rank-work_19502092", }); });</script></li><li class="js-percentile-work_19502092 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19502092; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19502092"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19502092 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19502092"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19502092; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19502092]").text(description); $(".js-view-count-work_19502092").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19502092").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19502092"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">6</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="28235" rel="nofollow" href="https://www.academia.edu/Documents/in/Multidisciplinary">Multidisciplinary</a>, <script data-card-contents-for-ri="28235" type="text/json">{"id":28235,"name":"Multidisciplinary","url":"https://www.academia.edu/Documents/in/Multidisciplinary","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="299021" rel="nofollow" href="https://www.academia.edu/Documents/in/Branch_and_Bound">Branch and Bound</a>, <script data-card-contents-for-ri="299021" type="text/json">{"id":299021,"name":"Branch and Bound","url":"https://www.academia.edu/Documents/in/Branch_and_Bound","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="466041" rel="nofollow" href="https://www.academia.edu/Documents/in/Market_Share">Market Share</a>, <script data-card-contents-for-ri="466041" type="text/json">{"id":466041,"name":"Market Share","url":"https://www.academia.edu/Documents/in/Market_Share","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="559962" rel="nofollow" href="https://www.academia.edu/Documents/in/Approximate_Algorithm">Approximate Algorithm</a><script data-card-contents-for-ri="559962" type="text/json">{"id":559962,"name":"Approximate Algorithm","url":"https://www.academia.edu/Documents/in/Approximate_Algorithm","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19502092]'), work: {"id":19502092,"title":"Exact algorithms for procurement problems under a total quantity discount structure","created_at":"2015-12-05T07:34:50.539-08:00","owner_id":34313351,"url":"https://www.academia.edu/19502092/Exact_algorithms_for_procurement_problems_under_a_total_quantity_discount_structure","slug":"Exact_algorithms_for_procurement_problems_under_a_total_quantity_discount_structure","dom_id":"work_19502092","summary":"In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This policy implies that every supplier announces a number of volume intervals and that the volume interval in which the total amount ordered lies determines the discount. Moreover, the discounted prices apply to all goods bought from the supplier, not only to those goods exceeding the volume threshold. We refer to this cost-minimization problem as the TQD problem. We give a mathematical formulation for this problem and argue that not only it is NP-hard, but also that there exists no polynomial-time approximation algorithm with a constant ratio (unless P = N P ). Apart from the basic form of the TQD problem, we describe three variants. In a first variant, the market share that one or more suppliers can obtain is constrained. Another variant allows the buyer to procure more goods than strictly needed, in order to reach a lower total cost. In a third variant, the number of winning suppliers is limited. We show that the TQD problem and its variants can be solved by solving a series of min-cost flow problems. Finally, we investigate the performance of three exact algorithms (min-cost flow based branch-and-bound, linear programming based branch-and-bound, and branch-and-cut) on randomly generated instances involving 50 suppliers and 100 goods. It turns out that even the large instances of the basic problem are solved to optimality within a limited amount of time. However, we find that different algorithms perform best in terms of computation time for different variants.","publication":"European Journal of Operational Research","publication_with_fallback":"European Journal of Operational Research","downloadable_attachments":[{"id":40655984,"asset_id":19502092,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40655984/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40655984/tqd_research_report_-_dries_goossens-libre.pdf?1449330105=\u0026response-content-disposition=attachment%3B+filename%3DExact_algorithms_for_procurement_problem.pdf\u0026Expires=1740129959\u0026Signature=aXECtDYv60elOSpJ3juX3MbuCUu2yvctfBHp6Qtw988kwkT6ecnEfgD1W1SpPy2C4uS5w4ZCY8eWdVj7xJUyTNNYmiVBSkpnQq3-hPUQakpYKPD1a62QJCQ5srosZhAeMn1O8nJi8yjMnVY4hBRSZex2pB8AzBIyrUN3nr5l18yGUGOaKHBnEAPWeTeaitvay7brnHeYvOSTHdy2Kueju9why0xeQ80pOi20tRfbS-26lSZa0jb4bqbZAc1lBwVMhEEwNweE2lwBl~dp7IIi54Q9mE2pYmWBqlbkx6QC96EDrHLzvr0kHoLDHSLt6xXiukTUsv1t65oe8v-sLJjYrA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40655984/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40655984/mini_magick20190220-6635-gvihki.png?1550707065"}],"downloadable_attachments_with_full_thumbnails":[{"id":40655984,"asset_id":19502092,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40655984/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40655984/tqd_research_report_-_dries_goossens-libre.pdf?1449330105=\u0026response-content-disposition=attachment%3B+filename%3DExact_algorithms_for_procurement_problem.pdf\u0026Expires=1740129959\u0026Signature=aXECtDYv60elOSpJ3juX3MbuCUu2yvctfBHp6Qtw988kwkT6ecnEfgD1W1SpPy2C4uS5w4ZCY8eWdVj7xJUyTNNYmiVBSkpnQq3-hPUQakpYKPD1a62QJCQ5srosZhAeMn1O8nJi8yjMnVY4hBRSZex2pB8AzBIyrUN3nr5l18yGUGOaKHBnEAPWeTeaitvay7brnHeYvOSTHdy2Kueju9why0xeQ80pOi20tRfbS-26lSZa0jb4bqbZAc1lBwVMhEEwNweE2lwBl~dp7IIi54Q9mE2pYmWBqlbkx6QC96EDrHLzvr0kHoLDHSLt6xXiukTUsv1t65oe8v-sLJjYrA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40655984/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40655984/mini_magick20190220-6635-gvihki.png?1550707065"}],"has_pdf":true,"has_fulltext":true,"page_count":27,"ordered_authors":[{"id":34313351,"first_name":"Frits","last_name":"Spieksma","domain_name":"kuleuven","page_name":"FritsSpieksma","display_name":"Frits Spieksma","profile_url":"https://kuleuven.academia.edu/FritsSpieksma","photo":"/images/s65_no_pic.png"},{"id":37928700,"first_name":"Dries","last_name":"Goossens","domain_name":"ugent","page_name":"DriesGoossens","display_name":"Dries Goossens","profile_url":"https://ugent.academia.edu/DriesGoossens","photo":"https://0.academia-photos.com/37928700/10932519/12200588/s65_dries.goossens.jpg"},{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":28235,"name":"Multidisciplinary","url":"https://www.academia.edu/Documents/in/Multidisciplinary","nofollow":true},{"id":299021,"name":"Branch and Bound","url":"https://www.academia.edu/Documents/in/Branch_and_Bound","nofollow":true},{"id":466041,"name":"Market Share","url":"https://www.academia.edu/Documents/in/Market_Share","nofollow":true},{"id":559962,"name":"Approximate Algorithm","url":"https://www.academia.edu/Documents/in/Approximate_Algorithm","nofollow":true},{"id":881191,"name":"Exact Algorithm","url":"https://www.academia.edu/Documents/in/Exact_Algorithm"},{"id":1451580,"name":"LINEAR PROGRAM","url":"https://www.academia.edu/Documents/in/LINEAR_PROGRAM"}],"publication_year":2007,"publication_year_with_fallback":2007,"paper_rank":null,"all_time_views":22,"active_discussion":{}}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19502094 coauthored" data-work_id="19502094" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19502094/Modeling_and_solving_the_periodic_maintenance_problem">Modeling and solving the periodic maintenance problem</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">We study the problem of scheduling maintenance services. Given is a set of m machines and integral cost-coefficients ai and bi for each machine i (1 :s; i :s; m). Time is discretized into unit-length periods; in each period at most one... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19502094" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">We study the problem of scheduling maintenance services. Given is a set of m machines and integral cost-coefficients ai and bi for each machine i (1 :s; i :s; m). Time is discretized into unit-length periods; in each period at most one machine can be serviced at a given service cost bi . The operating cost of machine i in a period equals ai times the number of periods since the last servicing of that machine i. The problem is to find a cyclic maintenance schedule of a given length T that minimizes total service and operating costs. We call this problem the Periodic Maintenance Problem or PMP.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19502094" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="3d28c9e83e3994ec0df2a723b6ec212e" rel="nofollow" data-download="{"attachment_id":40656056,"asset_id":19502094,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/40656056/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="34313351" href="https://kuleuven.academia.edu/FritsSpieksma">Frits Spieksma</a><script data-card-contents-for-user="34313351" type="text/json">{"id":34313351,"first_name":"Frits","last_name":"Spieksma","domain_name":"kuleuven","page_name":"FritsSpieksma","display_name":"Frits Spieksma","profile_url":"https://kuleuven.academia.edu/FritsSpieksma","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-19502094">+2</span><div class="hidden js-additional-users-19502094"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://sbe.academia.edu/AlexanderGrigoriev">Alexander Grigoriev</a></span></div><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-19502094'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-19502094').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_19502094 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19502094"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19502094, container: ".js-paper-rank-work_19502094", }); });</script></li><li class="js-percentile-work_19502094 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19502094; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19502094"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19502094 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19502094"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19502094; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19502094]").text(description); $(".js-view-count-work_19502094").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19502094").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19502094"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">8</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="2507" rel="nofollow" href="https://www.academia.edu/Documents/in/Combinatorial_Optimization">Combinatorial Optimization</a>, <script data-card-contents-for-ri="2507" type="text/json">{"id":2507,"name":"Combinatorial Optimization","url":"https://www.academia.edu/Documents/in/Combinatorial_Optimization","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="28235" rel="nofollow" href="https://www.academia.edu/Documents/in/Multidisciplinary">Multidisciplinary</a>, <script data-card-contents-for-ri="28235" type="text/json">{"id":28235,"name":"Multidisciplinary","url":"https://www.academia.edu/Documents/in/Multidisciplinary","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="91097" rel="nofollow" href="https://www.academia.edu/Documents/in/Column_Generation">Column Generation</a>, <script data-card-contents-for-ri="91097" type="text/json">{"id":91097,"name":"Column Generation","url":"https://www.academia.edu/Documents/in/Column_Generation","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="194740" rel="nofollow" href="https://www.academia.edu/Documents/in/Preventive_Maintenance">Preventive Maintenance</a><script data-card-contents-for-ri="194740" type="text/json">{"id":194740,"name":"Preventive Maintenance","url":"https://www.academia.edu/Documents/in/Preventive_Maintenance","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19502094]'), work: {"id":19502094,"title":"Modeling and solving the periodic maintenance problem","created_at":"2015-12-05T07:34:50.690-08:00","owner_id":34313351,"url":"https://www.academia.edu/19502094/Modeling_and_solving_the_periodic_maintenance_problem","slug":"Modeling_and_solving_the_periodic_maintenance_problem","dom_id":"work_19502094","summary":"We study the problem of scheduling maintenance services. Given is a set of m machines and integral cost-coefficients ai and bi for each machine i (1 :s; i :s; m). Time is discretized into unit-length periods; in each period at most one machine can be serviced at a given service cost bi . The operating cost of machine i in a period equals ai times the number of periods since the last servicing of that machine i. The problem is to find a cyclic maintenance schedule of a given length T that minimizes total service and operating costs. We call this problem the Periodic Maintenance Problem or PMP.","publication":"European Journal of Operational Research","publication_with_fallback":"European Journal of Operational Research","downloadable_attachments":[{"id":40656056,"asset_id":19502094,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40656056/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40656056/Modeling_and_solving_the_periodic_mainte20151205-31833-x7bpy6-libre.pdf?1449330100=\u0026response-content-disposition=attachment%3B+filename%3DModeling_and_solving_the_periodic_mainte.pdf\u0026Expires=1740040010\u0026Signature=EZHnQ60v060-apXaH1k30pMCv0AHfPVp2tfsXXF8XRqNNqr76TLnFbPd5X555wEhxh1BoAjPoQt~zk~dIYlpcOAfQvPFTuikXbGqKtdnfiSVHwGRn0kNSpF15AwslMkpqPGG9p9VNTBtA83vnmX572XrEMA8a~RUvVh1S00OhaQbOPq5jidKOFuf-J1ZVoLhwhtDtGHRy19hG24Ul7jWslkCFpQqhOv~JGUTjrcFZuIR6WjPQpmKrnh-Sm3QxiEeE17IGO-N4RkWzYlgLo8IT2OtTIcDoL5-LA2PxClR3jtzRrzGsgKAD4bQ3w2AXnJioOqHt~ePf6bhcL~qQHhMEg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40656056/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40656056/mini_magick20190220-6635-b1qehx.png?1550707104"}],"downloadable_attachments_with_full_thumbnails":[{"id":40656056,"asset_id":19502094,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40656056/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40656056/Modeling_and_solving_the_periodic_mainte20151205-31833-x7bpy6-libre.pdf?1449330100=\u0026response-content-disposition=attachment%3B+filename%3DModeling_and_solving_the_periodic_mainte.pdf\u0026Expires=1740040010\u0026Signature=EZHnQ60v060-apXaH1k30pMCv0AHfPVp2tfsXXF8XRqNNqr76TLnFbPd5X555wEhxh1BoAjPoQt~zk~dIYlpcOAfQvPFTuikXbGqKtdnfiSVHwGRn0kNSpF15AwslMkpqPGG9p9VNTBtA83vnmX572XrEMA8a~RUvVh1S00OhaQbOPq5jidKOFuf-J1ZVoLhwhtDtGHRy19hG24Ul7jWslkCFpQqhOv~JGUTjrcFZuIR6WjPQpmKrnh-Sm3QxiEeE17IGO-N4RkWzYlgLo8IT2OtTIcDoL5-LA2PxClR3jtzRrzGsgKAD4bQ3w2AXnJioOqHt~ePf6bhcL~qQHhMEg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40656056/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40656056/mini_magick20190220-6635-b1qehx.png?1550707104"}],"has_pdf":true,"has_fulltext":true,"page_count":29,"ordered_authors":[{"id":34313351,"first_name":"Frits","last_name":"Spieksma","domain_name":"kuleuven","page_name":"FritsSpieksma","display_name":"Frits Spieksma","profile_url":"https://kuleuven.academia.edu/FritsSpieksma","photo":"/images/s65_no_pic.png"},{"id":40900504,"first_name":"Alexander","last_name":"Grigoriev","domain_name":"sbe","page_name":"AlexanderGrigoriev","display_name":"Alexander Grigoriev","profile_url":"https://sbe.academia.edu/AlexanderGrigoriev","photo":"https://0.academia-photos.com/40900504/11121596/12411343/s65_alexander.grigoriev.jpg"},{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":2507,"name":"Combinatorial Optimization","url":"https://www.academia.edu/Documents/in/Combinatorial_Optimization","nofollow":true},{"id":28235,"name":"Multidisciplinary","url":"https://www.academia.edu/Documents/in/Multidisciplinary","nofollow":true},{"id":91097,"name":"Column Generation","url":"https://www.academia.edu/Documents/in/Column_Generation","nofollow":true},{"id":194740,"name":"Preventive Maintenance","url":"https://www.academia.edu/Documents/in/Preventive_Maintenance","nofollow":true},{"id":279027,"name":"European","url":"https://www.academia.edu/Documents/in/European"},{"id":832527,"name":"Branch and Price","url":"https://www.academia.edu/Documents/in/Branch_and_Price"},{"id":1868639,"name":"Exact solution methods","url":"https://www.academia.edu/Documents/in/Exact_solution_methods"},{"id":1993320,"name":"Optimal Solution","url":"https://www.academia.edu/Documents/in/Optimal_Solution"}],"publication_year":2006,"publication_year_with_fallback":2006,"paper_rank":null,"all_time_views":19,"active_discussion":{}}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19502096 coauthored" data-work_id="19502096" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19502096/The_assembly_of_printed_circuit_boards_A_case_with_multiple_machines_and_multiple_board_types">The assembly of printed circuit boards: A case with multiple machines and multiple board types</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In this paper a typical situation arising in the assembly of printed circuit boards is investigated. The planning problem we face is how to assemble boards of di erent types using a single line of placement machines. From a practical... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19502096" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In this paper a typical situation arising in the assembly of printed circuit boards is investigated. The planning problem we face is how to assemble boards of di erent types using a single line of placement machines. From a practical viewpoint, the multiplicity of board types adds signi cantly to the complexity of the problem, which is already very hard to solve in the case of a single board type. In addition, relatively few studies deal with the multiple board type case. We propose a solution procedure based on a hierarchical decomposition of the planning problem. An important subproblem in this decomposition is the so-called feeder rack assignment problem. By taking into account as much as possible the individual board type characteristics (as well as the machine characteristics) we heuristically solve this problem. The remaining subproblems are solved using constructive heuristics and local search methods. The solution procedure is tested on real-life instances. It turns out that, in terms of the makespan, we can substantially improve the current solutions.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19502096" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="33fec126705d9e44fe372be6222479fe" rel="nofollow" data-download="{"attachment_id":40656010,"asset_id":19502096,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/40656010/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40651073" href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a><script data-card-contents-for-user="40651073" type="text/json">{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-19502096">+1</span><div class="hidden js-additional-users-19502096"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://kuleuven.academia.edu/FritsSpieksma">Frits Spieksma</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-19502096'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-19502096').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_19502096 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19502096"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19502096, container: ".js-paper-rank-work_19502096", }); });</script></li><li class="js-percentile-work_19502096 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19502096; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19502096"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19502096 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19502096"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19502096; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19502096]").text(description); $(".js-view-count-work_19502096").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19502096").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19502096"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">5</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="28235" rel="nofollow" href="https://www.academia.edu/Documents/in/Multidisciplinary">Multidisciplinary</a>, <script data-card-contents-for-ri="28235" type="text/json">{"id":28235,"name":"Multidisciplinary","url":"https://www.academia.edu/Documents/in/Multidisciplinary","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="89056" rel="nofollow" href="https://www.academia.edu/Documents/in/Printed_Circuit_Board">Printed Circuit Board</a>, <script data-card-contents-for-ri="89056" type="text/json">{"id":89056,"name":"Printed Circuit Board","url":"https://www.academia.edu/Documents/in/Printed_Circuit_Board","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="107381" rel="nofollow" href="https://www.academia.edu/Documents/in/Local_Search">Local Search</a>, <script data-card-contents-for-ri="107381" type="text/json">{"id":107381,"name":"Local Search","url":"https://www.academia.edu/Documents/in/Local_Search","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="279027" rel="nofollow" href="https://www.academia.edu/Documents/in/European">European</a><script data-card-contents-for-ri="279027" type="text/json">{"id":279027,"name":"European","url":"https://www.academia.edu/Documents/in/European","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19502096]'), work: {"id":19502096,"title":"The assembly of printed circuit boards: A case with multiple machines and multiple board types","created_at":"2015-12-05T07:34:50.851-08:00","owner_id":34313351,"url":"https://www.academia.edu/19502096/The_assembly_of_printed_circuit_boards_A_case_with_multiple_machines_and_multiple_board_types","slug":"The_assembly_of_printed_circuit_boards_A_case_with_multiple_machines_and_multiple_board_types","dom_id":"work_19502096","summary":"In this paper a typical situation arising in the assembly of printed circuit boards is investigated. The planning problem we face is how to assemble boards of di erent types using a single line of placement machines. From a practical viewpoint, the multiplicity of board types adds signi cantly to the complexity of the problem, which is already very hard to solve in the case of a single board type. In addition, relatively few studies deal with the multiple board type case. We propose a solution procedure based on a hierarchical decomposition of the planning problem. An important subproblem in this decomposition is the so-called feeder rack assignment problem. By taking into account as much as possible the individual board type characteristics (as well as the machine characteristics) we heuristically solve this problem. The remaining subproblems are solved using constructive heuristics and local search methods. The solution procedure is tested on real-life instances. It turns out that, in terms of the makespan, we can substantially improve the current solutions.","publication":"European Journal of Operational Research","publication_with_fallback":"European Journal of Operational Research","downloadable_attachments":[{"id":40656010,"asset_id":19502096,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40656010/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40656010/The_Assembly_of_Printed_Circuit_Boards_A20151205-20374-1noy3pz-libre.pdf?1449330103=\u0026response-content-disposition=attachment%3B+filename%3DThe_assembly_of_printed_circuit_boards_A.pdf\u0026Expires=1740154566\u0026Signature=efr0OCSWmPDkD4Yny3Gj3OJPtMivkn5fQIq1gGddGcsL~BXdVtwk-4oOKjlNvT9Aj5X3TLnbNOs-oPYom7lE3b3XiONK9KCN45QUyJQl8Q9L33Rk-Qxy4KX3Ra-IEp~dcTrtyGM4YKLAfLIGiDdetF~GIPpoFHf1GKCDo9wlBa~rUzcQ53Y7mCcSqIuHRMwk4ZjFkzG5IPSNH4YRHjOcVFz3Y7MbsPFkzHJceT2Dd9BthdICbPFYmDqERa7iYzQUaLnRSxWyJfyBXs8HE1fx3iKNEOY4WcuDsydFZD3cylNiuTCU43RivoBUTbxTkHQnBzjw4DnQ9xaN~au8Husy9Q__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40656010/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40656010/mini_magick20190220-6641-15aofr8.png?1550707063"}],"downloadable_attachments_with_full_thumbnails":[{"id":40656010,"asset_id":19502096,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40656010/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40656010/The_Assembly_of_Printed_Circuit_Boards_A20151205-20374-1noy3pz-libre.pdf?1449330103=\u0026response-content-disposition=attachment%3B+filename%3DThe_assembly_of_printed_circuit_boards_A.pdf\u0026Expires=1740154566\u0026Signature=efr0OCSWmPDkD4Yny3Gj3OJPtMivkn5fQIq1gGddGcsL~BXdVtwk-4oOKjlNvT9Aj5X3TLnbNOs-oPYom7lE3b3XiONK9KCN45QUyJQl8Q9L33Rk-Qxy4KX3Ra-IEp~dcTrtyGM4YKLAfLIGiDdetF~GIPpoFHf1GKCDo9wlBa~rUzcQ53Y7mCcSqIuHRMwk4ZjFkzG5IPSNH4YRHjOcVFz3Y7MbsPFkzHJceT2Dd9BthdICbPFYmDqERa7iYzQUaLnRSxWyJfyBXs8HE1fx3iKNEOY4WcuDsydFZD3cylNiuTCU43RivoBUTbxTkHQnBzjw4DnQ9xaN~au8Husy9Q__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40656010/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40656010/mini_magick20190220-6641-15aofr8.png?1550707063"}],"has_pdf":true,"has_fulltext":true,"page_count":23,"ordered_authors":[{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"},{"id":34313351,"first_name":"Frits","last_name":"Spieksma","domain_name":"kuleuven","page_name":"FritsSpieksma","display_name":"Frits Spieksma","profile_url":"https://kuleuven.academia.edu/FritsSpieksma","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":28235,"name":"Multidisciplinary","url":"https://www.academia.edu/Documents/in/Multidisciplinary","nofollow":true},{"id":89056,"name":"Printed Circuit Board","url":"https://www.academia.edu/Documents/in/Printed_Circuit_Board","nofollow":true},{"id":107381,"name":"Local Search","url":"https://www.academia.edu/Documents/in/Local_Search","nofollow":true},{"id":279027,"name":"European","url":"https://www.academia.edu/Documents/in/European","nofollow":true},{"id":575847,"name":"Assignment Problem","url":"https://www.academia.edu/Documents/in/Assignment_Problem"}],"publication_year":1997,"publication_year_with_fallback":1997,"paper_rank":null,"all_time_views":36,"active_discussion":{}}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19502100 coauthored" data-work_id="19502100" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19502100/The_component_retrieval_problem_in_printed_circuit_board_assembly">The component retrieval problem in printed circuit board assembly</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The minimization of the makespan of a printed circuit board assembly process is a complex problem. Decisions involved in this problem concern the speci cation of the order in which components are to be placed on the board, and the... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19502100" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The minimization of the makespan of a printed circuit board assembly process is a complex problem. Decisions involved in this problem concern the speci cation of the order in which components are to be placed on the board, and the assignment of component types to the feeder slots of the placement machine. If some component types are assigned to multiple feeder slots, then the additional problem emerges of selecting, for each placement on the board, the feeder slot from which the related component type is to be retrieved. In this paper, we consider this Component Retrieval Problem for placement machines that operate in a similar way as the Fuji CP II. We explain why a simple forward dynamic programming scheme cannot provide an e cient solution to this problem, thereby invalidating the correctness of an earlier published approach. We then present a polynomial algorithm that solves the problem to optimality.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19502100" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="54184e85a9c84a71fba0ceb41be12ab0" rel="nofollow" data-download="{"attachment_id":40655992,"asset_id":19502100,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/40655992/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="34313351" href="https://kuleuven.academia.edu/FritsSpieksma">Frits Spieksma</a><script data-card-contents-for-user="34313351" type="text/json">{"id":34313351,"first_name":"Frits","last_name":"Spieksma","domain_name":"kuleuven","page_name":"FritsSpieksma","display_name":"Frits Spieksma","profile_url":"https://kuleuven.academia.edu/FritsSpieksma","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-19502100">+1</span><div class="hidden js-additional-users-19502100"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-19502100'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-19502100').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_19502100 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19502100"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19502100, container: ".js-paper-rank-work_19502100", }); });</script></li><li class="js-percentile-work_19502100 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19502100; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19502100"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19502100 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19502100"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19502100; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19502100]").text(description); $(".js-view-count-work_19502100").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19502100").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19502100"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="48" rel="nofollow" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="80414" rel="nofollow" href="https://www.academia.edu/Documents/in/Mathematical_Sciences">Mathematical Sciences</a>, <script data-card-contents-for-ri="80414" type="text/json">{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="618010" rel="nofollow" href="https://www.academia.edu/Documents/in/Flexible_Manufacturing_Systems">Flexible Manufacturing Systems</a>, <script data-card-contents-for-ri="618010" type="text/json">{"id":618010,"name":"Flexible Manufacturing Systems","url":"https://www.academia.edu/Documents/in/Flexible_Manufacturing_Systems","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="1948411" rel="nofollow" href="https://www.academia.edu/Documents/in/Printed_circuit_board_assembly">Printed circuit board assembly</a><script data-card-contents-for-ri="1948411" type="text/json">{"id":1948411,"name":"Printed circuit board assembly","url":"https://www.academia.edu/Documents/in/Printed_circuit_board_assembly","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19502100]'), work: {"id":19502100,"title":"The component retrieval problem in printed circuit board assembly","created_at":"2015-12-05T07:34:51.243-08:00","owner_id":34313351,"url":"https://www.academia.edu/19502100/The_component_retrieval_problem_in_printed_circuit_board_assembly","slug":"The_component_retrieval_problem_in_printed_circuit_board_assembly","dom_id":"work_19502100","summary":"The minimization of the makespan of a printed circuit board assembly process is a complex problem. Decisions involved in this problem concern the speci cation of the order in which components are to be placed on the board, and the assignment of component types to the feeder slots of the placement machine. If some component types are assigned to multiple feeder slots, then the additional problem emerges of selecting, for each placement on the board, the feeder slot from which the related component type is to be retrieved. In this paper, we consider this Component Retrieval Problem for placement machines that operate in a similar way as the Fuji CP II. We explain why a simple forward dynamic programming scheme cannot provide an e cient solution to this problem, thereby invalidating the correctness of an earlier published approach. We then present a polynomial algorithm that solves the problem to optimality.","publication":"International Journal of Flexible Manufacturing Systems","publication_with_fallback":"International Journal of Flexible Manufacturing Systems","downloadable_attachments":[{"id":40655992,"asset_id":19502100,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40655992/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40655992/The_Component_Retrieval_Problem_in_Print20151205-7404-1v5a6io-libre.pdf?1449330105=\u0026response-content-disposition=attachment%3B+filename%3DThe_component_retrieval_problem_in_print.pdf\u0026Expires=1740154566\u0026Signature=WGVrvpe~l1-kFFcNMwifzDt6jMbm~RwfwK53BjqQOE6D40XZ15Tg9qvElaK9qHqq84QtMillY1mcHTR1fc5-SZDqDv6HAkY1e0UJ5pCtfU66eYIIWXq-mEMPMzVH80l5lB28375AdI2CJqMpnmMa0XaSA3vQlYxC~~wlFv1GOMaCHOP5VWzKsbsVGY60KeK9OjtU-ppUxLA59nafr0AeiNaTNvQLl6kitevPY9bKwn-syRWTvphm1TaILfdtR~NlZZO6MNS2lOrZngB~WVdQFQAcldkq2orzwWD2nAQLH~QSCRwGtGb-8xgScrN4Sw7TuZv6t2u9kBZ0eyue-4GGuw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40655992/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40655992/mini_magick20190220-17343-1diihlt.png?1550707116"}],"downloadable_attachments_with_full_thumbnails":[{"id":40655992,"asset_id":19502100,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40655992/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40655992/The_Component_Retrieval_Problem_in_Print20151205-7404-1v5a6io-libre.pdf?1449330105=\u0026response-content-disposition=attachment%3B+filename%3DThe_component_retrieval_problem_in_print.pdf\u0026Expires=1740154566\u0026Signature=WGVrvpe~l1-kFFcNMwifzDt6jMbm~RwfwK53BjqQOE6D40XZ15Tg9qvElaK9qHqq84QtMillY1mcHTR1fc5-SZDqDv6HAkY1e0UJ5pCtfU66eYIIWXq-mEMPMzVH80l5lB28375AdI2CJqMpnmMa0XaSA3vQlYxC~~wlFv1GOMaCHOP5VWzKsbsVGY60KeK9OjtU-ppUxLA59nafr0AeiNaTNvQLl6kitevPY9bKwn-syRWTvphm1TaILfdtR~NlZZO6MNS2lOrZngB~WVdQFQAcldkq2orzwWD2nAQLH~QSCRwGtGb-8xgScrN4Sw7TuZv6t2u9kBZ0eyue-4GGuw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40655992/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40655992/mini_magick20190220-17343-1diihlt.png?1550707116"}],"has_pdf":true,"has_fulltext":true,"page_count":26,"ordered_authors":[{"id":34313351,"first_name":"Frits","last_name":"Spieksma","domain_name":"kuleuven","page_name":"FritsSpieksma","display_name":"Frits Spieksma","profile_url":"https://kuleuven.academia.edu/FritsSpieksma","photo":"/images/s65_no_pic.png"},{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering","nofollow":true},{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences","nofollow":true},{"id":618010,"name":"Flexible Manufacturing Systems","url":"https://www.academia.edu/Documents/in/Flexible_Manufacturing_Systems","nofollow":true},{"id":1948411,"name":"Printed circuit board assembly","url":"https://www.academia.edu/Documents/in/Printed_circuit_board_assembly","nofollow":true}],"publication_year":1996,"publication_year_with_fallback":1996,"paper_rank":null,"all_time_views":23,"active_discussion":{}}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19502107 coauthored" data-work_id="19502107" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19502107/Selecting_Telecommunication_Carriers_to_Obtain_Volume_Discounts">Selecting Telecommunication Carriers to Obtain Volume Discounts</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">During 2001 many European markets for mobile phones reached saturation. Hence, mobile phone operators have shifted their focus from growth and market share to cutting costs. One way of doing so is to reduce spending on international... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19502107" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">During 2001 many European markets for mobile phones reached saturation. Hence, mobile phone operators have shifted their focus from growth and market share to cutting costs. One way of doing so is to reduce spending on international calls, which are routed via network operating companies (carriers). These carriers charge per call-minute for each destination and may use a discount on total business volume to price their services. We developed a software system that supports decisions on allocating destinations to carriers. The core of this system is a min-cost flow routine that is embedded in a branch-and-bound framework. Our system solves the operational problem to optimality and performs what-if analyses and sensitivity analyses. A major telecommunication services provider implemented the system, realizing two benefits: it has structured the business process of allocating carriers to destinations and cut the costs of routing international calls.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19502107" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="9d117589da84c0a37d4cb0bffc11826f" rel="nofollow" data-download="{"attachment_id":40655996,"asset_id":19502107,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/40655996/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="34313351" href="https://kuleuven.academia.edu/FritsSpieksma">Frits Spieksma</a><script data-card-contents-for-user="34313351" type="text/json">{"id":34313351,"first_name":"Frits","last_name":"Spieksma","domain_name":"kuleuven","page_name":"FritsSpieksma","display_name":"Frits Spieksma","profile_url":"https://kuleuven.academia.edu/FritsSpieksma","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-19502107">+1</span><div class="hidden js-additional-users-19502107"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-19502107'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-19502107').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_19502107 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19502107"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19502107, container: ".js-paper-rank-work_19502107", }); });</script></li><li class="js-percentile-work_19502107 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19502107; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19502107"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19502107 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19502107"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19502107; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19502107]").text(description); $(".js-view-count-work_19502107").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19502107").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19502107"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="37" rel="nofollow" href="https://www.academia.edu/Documents/in/Information_Systems">Information Systems</a>, <script data-card-contents-for-ri="37" type="text/json">{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="305" rel="nofollow" href="https://www.academia.edu/Documents/in/Applied_Mathematics">Applied Mathematics</a>, <script data-card-contents-for-ri="305" type="text/json">{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="73149" rel="nofollow" href="https://www.academia.edu/Documents/in/Business_and_Management">Business and Management</a>, <script data-card-contents-for-ri="73149" type="text/json">{"id":73149,"name":"Business and Management","url":"https://www.academia.edu/Documents/in/Business_and_Management","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="176632" rel="nofollow" href="https://www.academia.edu/Documents/in/Interfaces">Interfaces</a><script data-card-contents-for-ri="176632" type="text/json">{"id":176632,"name":"Interfaces","url":"https://www.academia.edu/Documents/in/Interfaces","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19502107]'), work: {"id":19502107,"title":"Selecting Telecommunication Carriers to Obtain Volume Discounts","created_at":"2015-12-05T07:34:51.948-08:00","owner_id":34313351,"url":"https://www.academia.edu/19502107/Selecting_Telecommunication_Carriers_to_Obtain_Volume_Discounts","slug":"Selecting_Telecommunication_Carriers_to_Obtain_Volume_Discounts","dom_id":"work_19502107","summary":"During 2001 many European markets for mobile phones reached saturation. Hence, mobile phone operators have shifted their focus from growth and market share to cutting costs. One way of doing so is to reduce spending on international calls, which are routed via network operating companies (carriers). These carriers charge per call-minute for each destination and may use a discount on total business volume to price their services. We developed a software system that supports decisions on allocating destinations to carriers. The core of this system is a min-cost flow routine that is embedded in a branch-and-bound framework. Our system solves the operational problem to optimality and performs what-if analyses and sensitivity analyses. A major telecommunication services provider implemented the system, realizing two benefits: it has structured the business process of allocating carriers to destinations and cut the costs of routing international calls.","publication":"Interfaces","publication_with_fallback":"Interfaces","downloadable_attachments":[{"id":40655996,"asset_id":19502107,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40655996/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40655996/Selecting_telecommunication_carriers_to_20151205-7404-3ja8b7-libre.pdf?1449330102=\u0026response-content-disposition=attachment%3B+filename%3DSelecting_Telecommunication_Carriers_to.pdf\u0026Expires=1740080949\u0026Signature=EIr0EpSg2VygJOzBXT7TLSDUQJjjqEuAhnlZbFvETS8c8v1F9jlxcAPFON7FjhQ~CGYReU82OJkeso3nY41yBd7I~b6~j5vE558wMNfZDThGNpu73Qb3YRC9In2WJf5IR1aJw4X-N7HmMJ1O6O6v8c-qrc15P8NZGGcxf~Y6zoZN-zy8SEt2swaGL6l3fgQLdeR3sq6BovQcrRtWpPT8fs5ByH5ydPJ1ymp9Yb0SK2WkwbDD-NrU2zQr8KwfZjfYIEVf64naHchgyVM5aO~fr8pFuNnwlf31Az839JucXwCFUg-TE9NEqjwfPDJMtwSQfbdM5MRdM~jnwRekLxF7-A__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40655996/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40655996/mini_magick20190220-17343-1lw9v5x.png?1550707079"}],"downloadable_attachments_with_full_thumbnails":[{"id":40655996,"asset_id":19502107,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40655996/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40655996/Selecting_telecommunication_carriers_to_20151205-7404-3ja8b7-libre.pdf?1449330102=\u0026response-content-disposition=attachment%3B+filename%3DSelecting_Telecommunication_Carriers_to.pdf\u0026Expires=1740080949\u0026Signature=EIr0EpSg2VygJOzBXT7TLSDUQJjjqEuAhnlZbFvETS8c8v1F9jlxcAPFON7FjhQ~CGYReU82OJkeso3nY41yBd7I~b6~j5vE558wMNfZDThGNpu73Qb3YRC9In2WJf5IR1aJw4X-N7HmMJ1O6O6v8c-qrc15P8NZGGcxf~Y6zoZN-zy8SEt2swaGL6l3fgQLdeR3sq6BovQcrRtWpPT8fs5ByH5ydPJ1ymp9Yb0SK2WkwbDD-NrU2zQr8KwfZjfYIEVf64naHchgyVM5aO~fr8pFuNnwlf31Az839JucXwCFUg-TE9NEqjwfPDJMtwSQfbdM5MRdM~jnwRekLxF7-A__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40655996/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40655996/mini_magick20190220-17343-1lw9v5x.png?1550707079"}],"has_pdf":true,"has_fulltext":true,"page_count":9,"ordered_authors":[{"id":34313351,"first_name":"Frits","last_name":"Spieksma","domain_name":"kuleuven","page_name":"FritsSpieksma","display_name":"Frits Spieksma","profile_url":"https://kuleuven.academia.edu/FritsSpieksma","photo":"/images/s65_no_pic.png"},{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems","nofollow":true},{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics","nofollow":true},{"id":73149,"name":"Business and Management","url":"https://www.academia.edu/Documents/in/Business_and_Management","nofollow":true},{"id":176632,"name":"Interfaces","url":"https://www.academia.edu/Documents/in/Interfaces","nofollow":true}],"publication_year":2005,"publication_year_with_fallback":2005,"paper_rank":null,"all_time_views":396,"active_discussion":{}}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19502108 coauthored" data-work_id="19502108" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19502108/The_feeder_rack_assignment_problem_in_PCB_assembly_A_case_study">The feeder rack assignment problem in PCB assembly: A case study</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In this paper we describe a case study in the operational planning of the assembly of printed circuit boards. Given a line of placement machines and given a family of boards we develop a heuristic algorithm which focusses on the so-called... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19502108" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In this paper we describe a case study in the operational planning of the assembly of printed circuit boards. Given a line of placement machines and given a family of boards we develop a heuristic algorithm which focusses on the so-called feeder rack assignment problem. This problem addresses the question: where to attach the feeders alongside the feeder racks of the placement machines? Computational results on real-life instances indicate that the heuristic is superior to approaches currently used in practice.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19502108" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="0b9036f39efb8615e4bde7ddca787a08" rel="nofollow" data-download="{"attachment_id":40655997,"asset_id":19502108,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/40655997/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40651073" href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a><script data-card-contents-for-user="40651073" type="text/json">{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-19502108">+1</span><div class="hidden js-additional-users-19502108"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://kuleuven.academia.edu/FritsSpieksma">Frits Spieksma</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-19502108'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-19502108').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_19502108 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19502108"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19502108, container: ".js-paper-rank-work_19502108", }); });</script></li><li class="js-percentile-work_19502108 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19502108; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19502108"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19502108 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19502108"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19502108; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19502108]").text(description); $(".js-view-count-work_19502108").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19502108").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19502108"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">6</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="28235" rel="nofollow" href="https://www.academia.edu/Documents/in/Multidisciplinary">Multidisciplinary</a>, <script data-card-contents-for-ri="28235" type="text/json">{"id":28235,"name":"Multidisciplinary","url":"https://www.academia.edu/Documents/in/Multidisciplinary","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="61714" rel="nofollow" href="https://www.academia.edu/Documents/in/Production_economics">Production economics</a>, <script data-card-contents-for-ri="61714" type="text/json">{"id":61714,"name":"Production economics","url":"https://www.academia.edu/Documents/in/Production_economics","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="89056" rel="nofollow" href="https://www.academia.edu/Documents/in/Printed_Circuit_Board">Printed Circuit Board</a>, <script data-card-contents-for-ri="89056" type="text/json">{"id":89056,"name":"Printed Circuit Board","url":"https://www.academia.edu/Documents/in/Printed_Circuit_Board","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="96047" rel="nofollow" href="https://www.academia.edu/Documents/in/Case_Study">Case Study</a><script data-card-contents-for-ri="96047" type="text/json">{"id":96047,"name":"Case Study","url":"https://www.academia.edu/Documents/in/Case_Study","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19502108]'), work: {"id":19502108,"title":"The feeder rack assignment problem in PCB assembly: A case study","created_at":"2015-12-05T07:34:52.029-08:00","owner_id":34313351,"url":"https://www.academia.edu/19502108/The_feeder_rack_assignment_problem_in_PCB_assembly_A_case_study","slug":"The_feeder_rack_assignment_problem_in_PCB_assembly_A_case_study","dom_id":"work_19502108","summary":"In this paper we describe a case study in the operational planning of the assembly of printed circuit boards. Given a line of placement machines and given a family of boards we develop a heuristic algorithm which focusses on the so-called feeder rack assignment problem. This problem addresses the question: where to attach the feeders alongside the feeder racks of the placement machines? Computational results on real-life instances indicate that the heuristic is superior to approaches currently used in practice.","publication":"International Journal of Production Economics","publication_with_fallback":"International Journal of Production Economics","downloadable_attachments":[{"id":40655997,"asset_id":19502108,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40655997/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40655997/Feeder_rack_assignment_problem_in_PCB_as20151205-31828-1k1cl1s-libre.pdf?1449330102=\u0026response-content-disposition=attachment%3B+filename%3DThe_feeder_rack_assignment_problem_in_PC.pdf\u0026Expires=1740154566\u0026Signature=H3tBqAxZsenIWmXiq3rXCUECL4OOD1gZc~JZMUKQZF0QHDQ0JAxkYEemphv3vCCfLJXW0htCFLRlxbimNPz8E~ACVxsOdjRrSY-WvJtCrQ2K6KR1OJwDnYgnshCUr2SIRXILJJkxitDJCfr2Xj50oyoQTVGEOlkYDql8hYgQKmBJY6qlkEMx~eF58KVAXc-Ic0L~hH1AgwYaKJwcSDsMYHS0TGd1KzUgwWLDMK-wFnEiaJ1TJEOR4-EaUqNmimNCMgp0f18UUR4flbzwk8t1Cewm2wOh-u20lP4YNBwUjs-LnHP27W9KCeUWiRfCmHv2ZkHXglSZ5-vEvufdqSFTvA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40655997/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40655997/mini_magick20190220-6641-1ssgx7r.png?1550707061"}],"downloadable_attachments_with_full_thumbnails":[{"id":40655997,"asset_id":19502108,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40655997/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40655997/Feeder_rack_assignment_problem_in_PCB_as20151205-31828-1k1cl1s-libre.pdf?1449330102=\u0026response-content-disposition=attachment%3B+filename%3DThe_feeder_rack_assignment_problem_in_PC.pdf\u0026Expires=1740154566\u0026Signature=H3tBqAxZsenIWmXiq3rXCUECL4OOD1gZc~JZMUKQZF0QHDQ0JAxkYEemphv3vCCfLJXW0htCFLRlxbimNPz8E~ACVxsOdjRrSY-WvJtCrQ2K6KR1OJwDnYgnshCUr2SIRXILJJkxitDJCfr2Xj50oyoQTVGEOlkYDql8hYgQKmBJY6qlkEMx~eF58KVAXc-Ic0L~hH1AgwYaKJwcSDsMYHS0TGd1KzUgwWLDMK-wFnEiaJ1TJEOR4-EaUqNmimNCMgp0f18UUR4flbzwk8t1Cewm2wOh-u20lP4YNBwUjs-LnHP27W9KCeUWiRfCmHv2ZkHXglSZ5-vEvufdqSFTvA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40655997/download_file?st=MTc0MDE1MDk2Niw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40655997/mini_magick20190220-6641-1ssgx7r.png?1550707061"}],"has_pdf":true,"has_fulltext":true,"page_count":9,"ordered_authors":[{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"},{"id":34313351,"first_name":"Frits","last_name":"Spieksma","domain_name":"kuleuven","page_name":"FritsSpieksma","display_name":"Frits Spieksma","profile_url":"https://kuleuven.academia.edu/FritsSpieksma","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":28235,"name":"Multidisciplinary","url":"https://www.academia.edu/Documents/in/Multidisciplinary","nofollow":true},{"id":61714,"name":"Production economics","url":"https://www.academia.edu/Documents/in/Production_economics","nofollow":true},{"id":89056,"name":"Printed Circuit Board","url":"https://www.academia.edu/Documents/in/Printed_Circuit_Board","nofollow":true},{"id":96047,"name":"Case Study","url":"https://www.academia.edu/Documents/in/Case_Study","nofollow":true},{"id":575847,"name":"Assignment Problem","url":"https://www.academia.edu/Documents/in/Assignment_Problem"},{"id":1950746,"name":"Heuristic algorithm","url":"https://www.academia.edu/Documents/in/Heuristic_algorithm"}],"publication_year":2000,"publication_year_with_fallback":2000,"paper_rank":null,"all_time_views":75,"active_discussion":{}}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19856108 coauthored" data-work_id="19856108" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19856108/Cyclic_scheduling_in_robotic_flowshops">Cyclic scheduling in robotic flowshops</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Fully automated production cells consisting of flexible machines and a material handling robot have become commonplace in contemporary manufacturing systems. Much research on scheduling problems arising in such cells, in particular in... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19856108" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Fully automated production cells consisting of flexible machines and a material handling robot have become commonplace in contemporary manufacturing systems. Much research on scheduling problems arising in such cells, in particular in flowshop-like production cells, has been reported recently. Although there are many differences between the models, they all explicitly incorporate the interaction between the materials handling and the classical job processing decisions, since this interaction determines the efficiency of the cell. This paper surveys cyclic scheduling problems in robotic flowshops, models for such problems, and the complexity of solving these problems, thereby bringing together several streams of research that have by and large ignored one another, and describing and establishing links with other scheduling problems and combinatorial topics.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19856108" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="08c861556535aace75e66e122d056b2b" rel="nofollow" data-download="{"attachment_id":41282782,"asset_id":19856108,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/41282782/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40651073" href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a><script data-card-contents-for-user="40651073" type="text/json">{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-19856108">+1</span><div class="hidden js-additional-users-19856108"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://independent.academia.edu/VladimirKats">Vladimir Kats</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-19856108'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-19856108').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_19856108 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19856108"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19856108, container: ".js-paper-rank-work_19856108", }); });</script></li><li class="js-percentile-work_19856108 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19856108; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19856108"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19856108 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19856108"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19856108; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19856108]").text(description); $(".js-view-count-work_19856108").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19856108").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19856108"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">2</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="80414" rel="nofollow" href="https://www.academia.edu/Documents/in/Mathematical_Sciences">Mathematical Sciences</a>, <script data-card-contents-for-ri="80414" type="text/json">{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="623396" rel="nofollow" href="https://www.academia.edu/Documents/in/Manufacturing_System">Manufacturing System</a><script data-card-contents-for-ri="623396" type="text/json">{"id":623396,"name":"Manufacturing System","url":"https://www.academia.edu/Documents/in/Manufacturing_System","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19856108]'), work: {"id":19856108,"title":"Cyclic scheduling in robotic flowshops","created_at":"2015-12-27T13:26:59.298-08:00","owner_id":40651073,"url":"https://www.academia.edu/19856108/Cyclic_scheduling_in_robotic_flowshops","slug":"Cyclic_scheduling_in_robotic_flowshops","dom_id":"work_19856108","summary":"Fully automated production cells consisting of flexible machines and a material handling robot have become commonplace in contemporary manufacturing systems. Much research on scheduling problems arising in such cells, in particular in flowshop-like production cells, has been reported recently. Although there are many differences between the models, they all explicitly incorporate the interaction between the materials handling and the classical job processing decisions, since this interaction determines the efficiency of the cell. This paper surveys cyclic scheduling problems in robotic flowshops, models for such problems, and the complexity of solving these problems, thereby bringing together several streams of research that have by and large ignored one another, and describing and establishing links with other scheduling problems and combinatorial topics.","publication":"Annals of Operations …","publication_with_fallback":"Annals of Operations …","downloadable_attachments":[{"id":41282782,"asset_id":19856108,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/41282782/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/41282782/Cyclic_scheduling_in_robotic_flowshops20160117-30663-118v51c-libre.pdf?1453020917=\u0026response-content-disposition=attachment%3B+filename%3DCyclic_scheduling_in_robotic_flowshops.pdf\u0026Expires=1740154566\u0026Signature=KsmIRyIn0~yKi8FzDWNH2JoaT4P9AumCUIZTGVpL~1JEhHuNvAvJLGeqQwW0c8TH6QfJx8ZJ-tmD1QMSGyBGWv2sK3kAZh3nX2bWMq-oVcDMeZmPGpD757revi74C0bMhaI29jklj9gYK~sIh4u8MLIk1WiXFoVIqkvpLuK6KXeCtK~akOodyyCNGapAD1j2ubXzAldIqJh-onTlouRFzPLXBwpXZdAm9NreBIA0JuErByWVF8nWONKwX-XcL9zDSKpnQVlC8OMYWpTBUw2kIAFH2H37ErW6FWvx0Z2uXyx8S0Itxb7RQpfnEmv3Ge1uIkN~~VSTHqZXVV1IGpWyrA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/41282782/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/41282782/mini_magick20190219-25319-104uwp2.png?1550615003"}],"downloadable_attachments_with_full_thumbnails":[{"id":41282782,"asset_id":19856108,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/41282782/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/41282782/Cyclic_scheduling_in_robotic_flowshops20160117-30663-118v51c-libre.pdf?1453020917=\u0026response-content-disposition=attachment%3B+filename%3DCyclic_scheduling_in_robotic_flowshops.pdf\u0026Expires=1740154566\u0026Signature=KsmIRyIn0~yKi8FzDWNH2JoaT4P9AumCUIZTGVpL~1JEhHuNvAvJLGeqQwW0c8TH6QfJx8ZJ-tmD1QMSGyBGWv2sK3kAZh3nX2bWMq-oVcDMeZmPGpD757revi74C0bMhaI29jklj9gYK~sIh4u8MLIk1WiXFoVIqkvpLuK6KXeCtK~akOodyyCNGapAD1j2ubXzAldIqJh-onTlouRFzPLXBwpXZdAm9NreBIA0JuErByWVF8nWONKwX-XcL9zDSKpnQVlC8OMYWpTBUw2kIAFH2H37ErW6FWvx0Z2uXyx8S0Itxb7RQpfnEmv3Ge1uIkN~~VSTHqZXVV1IGpWyrA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/41282782/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/41282782/mini_magick20190219-25319-104uwp2.png?1550615003"}],"has_pdf":true,"has_fulltext":true,"page_count":28,"ordered_authors":[{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"},{"id":34529385,"first_name":"Vladimir","last_name":"Kats","domain_name":"independent","page_name":"VladimirKats","display_name":"Vladimir Kats","profile_url":"https://independent.academia.edu/VladimirKats","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences","nofollow":true},{"id":623396,"name":"Manufacturing System","url":"https://www.academia.edu/Documents/in/Manufacturing_System","nofollow":true}],"publication_year":2000,"publication_year_with_fallback":2000,"paper_rank":null,"all_time_views":42,"active_discussion":{}}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19856109" data-work_id="19856109" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19856109/Optimizing_sterilization_logistics_in_hospitals">Optimizing sterilization logistics in hospitals</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">This paper deals with the optimization of the flow of sterile instruments in hospitals which takes place between the sterilization department and the operating theatre. This topic is especially of interest in view of the current attempts... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19856109" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">This paper deals with the optimization of the flow of sterile instruments in hospitals which takes place between the sterilization department and the operating theatre. This topic is especially of interest in view of the current attempts of hospitals to cut cost by outsourcing sterilization tasks. Oftentimes, outsourcing implies placing the sterilization unit at a larger distance, hence introducing a longer logistic loop, which may result in lower instrument availability, and higher cost. This paper discusses the optimization problems that have to be solved when redesigning processes so as to improve material availability and reduce cost. We consider changing the logistic management principles, use of visibility information, and optimizing the composition of the nets of sterile materials.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19856109" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="8e6ae92cacb7d3d6547a9253c7f628d5" rel="nofollow" data-download="{"attachment_id":41282739,"asset_id":19856109,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/41282739/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40651073" href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a><script data-card-contents-for-user="40651073" type="text/json">{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_19856109 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19856109"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19856109, container: ".js-paper-rank-work_19856109", }); });</script></li><li class="js-percentile-work_19856109 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19856109; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19856109"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19856109 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19856109"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19856109; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19856109]").text(description); $(".js-view-count-work_19856109").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19856109").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19856109"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="7300" rel="nofollow" href="https://www.academia.edu/Documents/in/Systems_Theory">Systems Theory</a>, <script data-card-contents-for-ri="7300" type="text/json">{"id":7300,"name":"Systems Theory","url":"https://www.academia.edu/Documents/in/Systems_Theory","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="46254" rel="nofollow" href="https://www.academia.edu/Documents/in/Optimization_Problem">Optimization Problem</a>, <script data-card-contents-for-ri="46254" type="text/json">{"id":46254,"name":"Optimization Problem","url":"https://www.academia.edu/Documents/in/Optimization_Problem","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="84107" rel="nofollow" href="https://www.academia.edu/Documents/in/Hospital_administration">Hospital administration</a>, <script data-card-contents-for-ri="84107" type="text/json">{"id":84107,"name":"Hospital administration","url":"https://www.academia.edu/Documents/in/Hospital_administration","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="177876" rel="nofollow" href="https://www.academia.edu/Documents/in/Sterilization">Sterilization</a><script data-card-contents-for-ri="177876" type="text/json">{"id":177876,"name":"Sterilization","url":"https://www.academia.edu/Documents/in/Sterilization","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19856109]'), work: {"id":19856109,"title":"Optimizing sterilization logistics in hospitals","created_at":"2015-12-27T13:26:59.760-08:00","owner_id":40651073,"url":"https://www.academia.edu/19856109/Optimizing_sterilization_logistics_in_hospitals","slug":"Optimizing_sterilization_logistics_in_hospitals","dom_id":"work_19856109","summary":"This paper deals with the optimization of the flow of sterile instruments in hospitals which takes place between the sterilization department and the operating theatre. This topic is especially of interest in view of the current attempts of hospitals to cut cost by outsourcing sterilization tasks. Oftentimes, outsourcing implies placing the sterilization unit at a larger distance, hence introducing a longer logistic loop, which may result in lower instrument availability, and higher cost. This paper discusses the optimization problems that have to be solved when redesigning processes so as to improve material availability and reduce cost. We consider changing the logistic management principles, use of visibility information, and optimizing the composition of the nets of sterile materials.","publication":"Health Care Management Science","publication_with_fallback":"Health Care Management Science","downloadable_attachments":[{"id":41282739,"asset_id":19856109,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/41282739/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/41282739/Optimizing_sterilization_logistics_in_ho20160117-1865-e69a0q-libre.pdf?1453020841=\u0026response-content-disposition=attachment%3B+filename%3DOptimizing_sterilization_logistics_in_ho.pdf\u0026Expires=1740096572\u0026Signature=byZQvw61sDlqXcM3f~85CxrAVApW9UUHdtOmxamj-mcbLxuEBqyvGjc~9gaJvmshxJeccsftw9iGluDd0KWLDx~fAF2w~zg3u-b2hlaoE7mh0lZVbCV65b2riyxkWZ7PkQRvDGwN5P5RriE-1osC0EYUij0GLegIRFESMfhT~R3xQn90EYfZl2I7jUvi3LcR1dtv19EOjMTBhBUsVuRQNxf7gSbRq5MIX5iPnrPOpvVOAOYqV~0G1LPuHDr8vFNDSFNgyEGtnBllnZa2UB5zsuVwqlmpAqA8oGpAjrx4Ix8ZyInK6CnDb4pBGekbz-WBGKNpPyAwP7sEutQ6f24J~A__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/41282739/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/41282739/mini_magick20190219-5708-w3d50k.png?1550615010"}],"downloadable_attachments_with_full_thumbnails":[{"id":41282739,"asset_id":19856109,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/41282739/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/41282739/Optimizing_sterilization_logistics_in_ho20160117-1865-e69a0q-libre.pdf?1453020841=\u0026response-content-disposition=attachment%3B+filename%3DOptimizing_sterilization_logistics_in_ho.pdf\u0026Expires=1740096572\u0026Signature=byZQvw61sDlqXcM3f~85CxrAVApW9UUHdtOmxamj-mcbLxuEBqyvGjc~9gaJvmshxJeccsftw9iGluDd0KWLDx~fAF2w~zg3u-b2hlaoE7mh0lZVbCV65b2riyxkWZ7PkQRvDGwN5P5RriE-1osC0EYUij0GLegIRFESMfhT~R3xQn90EYfZl2I7jUvi3LcR1dtv19EOjMTBhBUsVuRQNxf7gSbRq5MIX5iPnrPOpvVOAOYqV~0G1LPuHDr8vFNDSFNgyEGtnBllnZa2UB5zsuVwqlmpAqA8oGpAjrx4Ix8ZyInK6CnDb4pBGekbz-WBGKNpPyAwP7sEutQ6f24J~A__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/41282739/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/41282739/mini_magick20190219-5708-w3d50k.png?1550615010"}],"has_pdf":true,"has_fulltext":true,"page_count":11,"ordered_authors":[{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":7300,"name":"Systems Theory","url":"https://www.academia.edu/Documents/in/Systems_Theory","nofollow":true},{"id":46254,"name":"Optimization Problem","url":"https://www.academia.edu/Documents/in/Optimization_Problem","nofollow":true},{"id":84107,"name":"Hospital administration","url":"https://www.academia.edu/Documents/in/Hospital_administration","nofollow":true},{"id":177876,"name":"Sterilization","url":"https://www.academia.edu/Documents/in/Sterilization","nofollow":true},{"id":410370,"name":"Public health systems and services research","url":"https://www.academia.edu/Documents/in/Public_health_systems_and_services_research-1"},{"id":474853,"name":"Operating Rooms","url":"https://www.academia.edu/Documents/in/Operating_Rooms"},{"id":2257649,"name":"Surgical Instruments","url":"https://www.academia.edu/Documents/in/Surgical_Instruments"}],"publication_year":2008,"publication_year_with_fallback":2008,"paper_rank":null,"all_time_views":53,"active_discussion":{}}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19856110" data-work_id="19856110" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19856110/Models_and_Heuristics_for_Dynamic_Revenue_Optimization_in_Road_Transport">Models and Heuristics for Dynamic Revenue Optimization in Road Transport</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In this document we consider an optimization problem which origins from freight exchanges. The aim is to increase the utilization of already scheduled road transportation activities by accepting extra loads. Such utilization increase... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19856110" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In this document we consider an optimization problem which origins from freight exchanges. The aim is to increase the utilization of already scheduled road transportation activities by accepting extra loads. Such utilization increase reduces costs for the freight sender, increases revenue for the the transportation provider, and reduces congestion and pollution for the society at large. We explore various models which capture different real life problem settings. Our explorations regard finding good solutions for off line, on line, and on the line versions of the problems. We link the problem with revenue management literature and resource allocation literate, and report computational results on proposed approximation algorithms.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19856110" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="0f57abdd53c28ed74542570d88b0c685" rel="nofollow" data-download="{"attachment_id":41282758,"asset_id":19856110,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/41282758/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40651073" href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a><script data-card-contents-for-user="40651073" type="text/json">{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_19856110 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19856110"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19856110, container: ".js-paper-rank-work_19856110", }); });</script></li><li class="js-percentile-work_19856110 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19856110; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19856110"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19856110 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19856110"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19856110; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19856110]").text(description); $(".js-view-count-work_19856110").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19856110").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19856110"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">3</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="9742" rel="nofollow" href="https://www.academia.edu/Documents/in/Resource_Allocation">Resource Allocation</a>, <script data-card-contents-for-ri="9742" type="text/json">{"id":9742,"name":"Resource Allocation","url":"https://www.academia.edu/Documents/in/Resource_Allocation","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="12847" rel="nofollow" href="https://www.academia.edu/Documents/in/Revenue_Management">Revenue Management</a>, <script data-card-contents-for-ri="12847" type="text/json">{"id":12847,"name":"Revenue Management","url":"https://www.academia.edu/Documents/in/Revenue_Management","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="46254" rel="nofollow" href="https://www.academia.edu/Documents/in/Optimization_Problem">Optimization Problem</a><script data-card-contents-for-ri="46254" type="text/json">{"id":46254,"name":"Optimization Problem","url":"https://www.academia.edu/Documents/in/Optimization_Problem","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19856110]'), work: {"id":19856110,"title":"Models and Heuristics for Dynamic Revenue Optimization in Road Transport","created_at":"2015-12-27T13:26:59.895-08:00","owner_id":40651073,"url":"https://www.academia.edu/19856110/Models_and_Heuristics_for_Dynamic_Revenue_Optimization_in_Road_Transport","slug":"Models_and_Heuristics_for_Dynamic_Revenue_Optimization_in_Road_Transport","dom_id":"work_19856110","summary":"In this document we consider an optimization problem which origins from freight exchanges. The aim is to increase the utilization of already scheduled road transportation activities by accepting extra loads. Such utilization increase reduces costs for the freight sender, increases revenue for the the transportation provider, and reduces congestion and pollution for the society at large. We explore various models which capture different real life problem settings. Our explorations regard finding good solutions for off line, on line, and on the line versions of the problems. We link the problem with revenue management literature and resource allocation literate, and report computational results on proposed approximation algorithms.","publication":null,"publication_with_fallback":null,"downloadable_attachments":[{"id":41282758,"asset_id":19856110,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/41282758/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/41282758/Models_and_Heuristics_for_Dynamic_Revenu20160117-30660-1kvmvjd-libre.pdf?1453020916=\u0026response-content-disposition=attachment%3B+filename%3DModels_and_Heuristics_for_Dynamic_Revenu.pdf\u0026Expires=1740096573\u0026Signature=R1OrLD-yYGk6xTJZUhPT2q-X7Ms2kfF99OIRl00qWXPgwDoIyv6jOG-EHyQeto07iyMnd~Nf88hq9u2PPnlqvTJ3bdKyNDArKjl7ksBgn400kFxTtT2I0j~r7lB-IGpqjEY4M5qKonfanCKYsI6AOD1bhf5JNic-bQlchZFxqRT6idO8LLxoMr3DIX0kZCqCQpv~21VrBbH719EpJ1TVvr6FivjZk7B0V3WFPRJgklI9yZ~whuL0k46GJPOnbaoyFxas3lNMYQk1b5wpxbLsdmD~ip4MZ3MhU0xKD3ol8JNSHsBTfS-nTd0OtPCRoglzK8cot~VxVcg9vSVAUW4Vzg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/41282758/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/41282758/mini_magick20190219-5718-szmifx.png?1550615007"}],"downloadable_attachments_with_full_thumbnails":[{"id":41282758,"asset_id":19856110,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/41282758/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/41282758/Models_and_Heuristics_for_Dynamic_Revenu20160117-30660-1kvmvjd-libre.pdf?1453020916=\u0026response-content-disposition=attachment%3B+filename%3DModels_and_Heuristics_for_Dynamic_Revenu.pdf\u0026Expires=1740096573\u0026Signature=R1OrLD-yYGk6xTJZUhPT2q-X7Ms2kfF99OIRl00qWXPgwDoIyv6jOG-EHyQeto07iyMnd~Nf88hq9u2PPnlqvTJ3bdKyNDArKjl7ksBgn400kFxTtT2I0j~r7lB-IGpqjEY4M5qKonfanCKYsI6AOD1bhf5JNic-bQlchZFxqRT6idO8LLxoMr3DIX0kZCqCQpv~21VrBbH719EpJ1TVvr6FivjZk7B0V3WFPRJgklI9yZ~whuL0k46GJPOnbaoyFxas3lNMYQk1b5wpxbLsdmD~ip4MZ3MhU0xKD3ol8JNSHsBTfS-nTd0OtPCRoglzK8cot~VxVcg9vSVAUW4Vzg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/41282758/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/41282758/mini_magick20190219-5718-szmifx.png?1550615007"}],"has_pdf":true,"has_fulltext":true,"page_count":20,"ordered_authors":[{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":9742,"name":"Resource Allocation","url":"https://www.academia.edu/Documents/in/Resource_Allocation","nofollow":true},{"id":12847,"name":"Revenue Management","url":"https://www.academia.edu/Documents/in/Revenue_Management","nofollow":true},{"id":46254,"name":"Optimization Problem","url":"https://www.academia.edu/Documents/in/Optimization_Problem","nofollow":true}],"publication_year":2007,"publication_year_with_fallback":2007,"paper_rank":null,"all_time_views":29,"active_discussion":{}}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19856111" data-work_id="19856111" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19856111/A_Framework_for_the_Complexity_of_High_Multiplicity_Scheduling_Problems">A Framework for the Complexity of High-Multiplicity Scheduling Problems</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The purpose of this note is to propose a complexity framework for the analysis of high multiplicity scheduling problems. Part of this framework relies on earlier work aiming at the definition of output-sensitive complexity measures for... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19856111" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The purpose of this note is to propose a complexity framework for the analysis of high multiplicity scheduling problems. Part of this framework relies on earlier work aiming at the definition of output-sensitive complexity measures for the analysis of algorithms which produce "large" outputs. However, different classes emerge according as we look at schedules as sets of starting times, or as related single-valued mappings.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19856111" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="1eadb8edeb5bc948f45882d04844dd9b" rel="nofollow" data-download="{"attachment_id":40912295,"asset_id":19856111,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/40912295/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40651073" href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a><script data-card-contents-for-user="40651073" type="text/json">{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_19856111 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19856111"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19856111, container: ".js-paper-rank-work_19856111", }); });</script></li><li class="js-percentile-work_19856111 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19856111; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19856111"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19856111 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19856111"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19856111; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19856111]").text(description); $(".js-view-count-work_19856111").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19856111").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19856111"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">6</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="305" rel="nofollow" href="https://www.academia.edu/Documents/in/Applied_Mathematics">Applied Mathematics</a>, <script data-card-contents-for-ri="305" type="text/json">{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="2189" rel="nofollow" href="https://www.academia.edu/Documents/in/Computational_Complexity">Computational Complexity</a>, <script data-card-contents-for-ri="2189" type="text/json">{"id":2189,"name":"Computational Complexity","url":"https://www.academia.edu/Documents/in/Computational_Complexity","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="2507" rel="nofollow" href="https://www.academia.edu/Documents/in/Combinatorial_Optimization">Combinatorial Optimization</a>, <script data-card-contents-for-ri="2507" type="text/json">{"id":2507,"name":"Combinatorial Optimization","url":"https://www.academia.edu/Documents/in/Combinatorial_Optimization","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="19997" rel="nofollow" href="https://www.academia.edu/Documents/in/Pure_Mathematics">Pure Mathematics</a><script data-card-contents-for-ri="19997" type="text/json">{"id":19997,"name":"Pure Mathematics","url":"https://www.academia.edu/Documents/in/Pure_Mathematics","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19856111]'), work: {"id":19856111,"title":"A Framework for the Complexity of High-Multiplicity Scheduling Problems","created_at":"2015-12-27T13:27:00.004-08:00","owner_id":40651073,"url":"https://www.academia.edu/19856111/A_Framework_for_the_Complexity_of_High_Multiplicity_Scheduling_Problems","slug":"A_Framework_for_the_Complexity_of_High_Multiplicity_Scheduling_Problems","dom_id":"work_19856111","summary":"The purpose of this note is to propose a complexity framework for the analysis of high multiplicity scheduling problems. Part of this framework relies on earlier work aiming at the definition of output-sensitive complexity measures for the analysis of algorithms which produce \"large\" outputs. However, different classes emerge according as we look at schedules as sets of starting times, or as related single-valued mappings.","publication":"Journal of Combinatorial Optimization","publication_with_fallback":"Journal of Combinatorial Optimization","downloadable_attachments":[{"id":40912295,"asset_id":19856111,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40912295/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40912295/s10878-005-1414-7-libre.pdf20151230-6069-p2rg89?1451498423=\u0026response-content-disposition=attachment%3B+filename%3DA_Framework_for_the_Complexity_of_High_M.pdf\u0026Expires=1740096573\u0026Signature=Z-3tY2O3daG-P7d~ZyowEIzwI43T2DkGPJqZCwDtmv4VoyHCfC~hcxVMD~f9rHp6pKN5SavdfxdKr9-12EIk4~ElNqwbI1l3Y223TSYq0FgtkjK-ImLUO8T4wbK9JYA6APNJHb8UbRErN~cqDF3AGOpGnAAA4Py-w49i6Wj9S3rWwd9LswETVg0mGX7FdLp3IBkUVwz2iTnR2sVoVLxVTA9aSCAb0bDCTRZ~fUnP8pLOKCzVIYrjb3sI1~pYi8KF~Kjl4HUZRByQdFMjXxrdty~qD7msFh9B34uQkhgJo~Mfq40ARG2Yw4xoki90hCM8SvUfHdNoyd9V3XjXfBs0hw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40912295/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40912295/mini_magick20190220-18784-19p0uvd.png?1550670439"}],"downloadable_attachments_with_full_thumbnails":[{"id":40912295,"asset_id":19856111,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40912295/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40912295/s10878-005-1414-7-libre.pdf20151230-6069-p2rg89?1451498423=\u0026response-content-disposition=attachment%3B+filename%3DA_Framework_for_the_Complexity_of_High_M.pdf\u0026Expires=1740096573\u0026Signature=Z-3tY2O3daG-P7d~ZyowEIzwI43T2DkGPJqZCwDtmv4VoyHCfC~hcxVMD~f9rHp6pKN5SavdfxdKr9-12EIk4~ElNqwbI1l3Y223TSYq0FgtkjK-ImLUO8T4wbK9JYA6APNJHb8UbRErN~cqDF3AGOpGnAAA4Py-w49i6Wj9S3rWwd9LswETVg0mGX7FdLp3IBkUVwz2iTnR2sVoVLxVTA9aSCAb0bDCTRZ~fUnP8pLOKCzVIYrjb3sI1~pYi8KF~Kjl4HUZRByQdFMjXxrdty~qD7msFh9B34uQkhgJo~Mfq40ARG2Yw4xoki90hCM8SvUfHdNoyd9V3XjXfBs0hw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40912295/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40912295/mini_magick20190220-18784-19p0uvd.png?1550670439"}],"has_pdf":true,"has_fulltext":true,"page_count":11,"ordered_authors":[{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics","nofollow":true},{"id":2189,"name":"Computational Complexity","url":"https://www.academia.edu/Documents/in/Computational_Complexity","nofollow":true},{"id":2507,"name":"Combinatorial Optimization","url":"https://www.academia.edu/Documents/in/Combinatorial_Optimization","nofollow":true},{"id":19997,"name":"Pure Mathematics","url":"https://www.academia.edu/Documents/in/Pure_Mathematics","nofollow":true},{"id":32702,"name":"Design and Analysis of Algorithms","url":"https://www.academia.edu/Documents/in/Design_and_Analysis_of_Algorithms"},{"id":556845,"name":"Numerical Analysis and Computational Mathematics","url":"https://www.academia.edu/Documents/in/Numerical_Analysis_and_Computational_Mathematics"}],"publication_year":2005,"publication_year_with_fallback":2005,"paper_rank":null,"all_time_views":18,"active_discussion":{}}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19856112" data-work_id="19856112" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19856112/Cyclic_scheduling_in_3_machine_robotic_flow_shops">Cyclic scheduling in 3-machine robotic flow shops</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">We consider a robotic flow shop model in which a single robot is responsible for the transportation of parts between machines. For reasons of simplicity, when the shop is to produce a large number of identical parts, the robot usually... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19856112" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">We consider a robotic flow shop model in which a single robot is responsible for the transportation of parts between machines. For reasons of simplicity, when the shop is to produce a large number of identical parts, the robot usually performs repeatedly a fixed sequence of activities. This sequence of activities is called a 1-unit cycle if each execution of the sequence results in the production of exactly one part. It has been conjectured that 1-unit cycles yield optimal production rates for 3-machine robotic flow shops. We establish the validity of this conjecture.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19856112" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="bfe941a463c5f05372803c36fda791bd" rel="nofollow" data-download="{"attachment_id":40882055,"asset_id":19856112,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/40882055/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40651073" href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a><script data-card-contents-for-user="40651073" type="text/json">{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_19856112 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19856112"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19856112, container: ".js-paper-rank-work_19856112", }); });</script></li><li class="js-percentile-work_19856112 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19856112; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19856112"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19856112 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19856112"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19856112; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19856112]").text(description); $(".js-view-count-work_19856112").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19856112").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19856112"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="305" rel="nofollow" href="https://www.academia.edu/Documents/in/Applied_Mathematics">Applied Mathematics</a>, <script data-card-contents-for-ri="305" type="text/json">{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="9048" rel="nofollow" href="https://www.academia.edu/Documents/in/Scheduling">Scheduling</a>, <script data-card-contents-for-ri="9048" type="text/json">{"id":9048,"name":"Scheduling","url":"https://www.academia.edu/Documents/in/Scheduling","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="73149" rel="nofollow" href="https://www.academia.edu/Documents/in/Business_and_Management">Business and Management</a>, <script data-card-contents-for-ri="73149" type="text/json">{"id":73149,"name":"Business and Management","url":"https://www.academia.edu/Documents/in/Business_and_Management","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="556845" rel="nofollow" href="https://www.academia.edu/Documents/in/Numerical_Analysis_and_Computational_Mathematics">Numerical Analysis and Computational Mathematics</a><script data-card-contents-for-ri="556845" type="text/json">{"id":556845,"name":"Numerical Analysis and Computational Mathematics","url":"https://www.academia.edu/Documents/in/Numerical_Analysis_and_Computational_Mathematics","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19856112]'), work: {"id":19856112,"title":"Cyclic scheduling in 3-machine robotic flow shops","created_at":"2015-12-27T13:27:00.079-08:00","owner_id":40651073,"url":"https://www.academia.edu/19856112/Cyclic_scheduling_in_3_machine_robotic_flow_shops","slug":"Cyclic_scheduling_in_3_machine_robotic_flow_shops","dom_id":"work_19856112","summary":"We consider a robotic flow shop model in which a single robot is responsible for the transportation of parts between machines. For reasons of simplicity, when the shop is to produce a large number of identical parts, the robot usually performs repeatedly a fixed sequence of activities. This sequence of activities is called a 1-unit cycle if each execution of the sequence results in the production of exactly one part. It has been conjectured that 1-unit cycles yield optimal production rates for 3-machine robotic flow shops. We establish the validity of this conjecture.","publication":"Journal of Scheduling","publication_with_fallback":"Journal of Scheduling","downloadable_attachments":[{"id":40882055,"asset_id":19856112,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40882055/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40882055/_28sici_291099-1425_28199901_2F02_292_3A1_3C35_3A_3Aaid-jos15_3E3.0.co_3B2-j-libre.pdf20151227-2777-tkya5?1451251763=\u0026response-content-disposition=attachment%3B+filename%3DCyclic_scheduling_in_3_machine_robotic_f.pdf\u0026Expires=1740096573\u0026Signature=XDw31gUqSyDFFcdV2JE9kJuabAypntjynCHAs0jjKuZ7yaAeVxaqJF~GLW3T0C8hX-c20PdJLjhNq2bqWBxlGlIPVPhma4o7C~WWDJflCoNS4MYpgPPnz0BNEmbIGsPGioFRMZAoHAYGDzm6y4TRUctN9Y65ewymOGxJQq3IJAH5ZpV2L~dswrONXC5Wm5G27MXbi-Ik4SVmdoscZXHRcVUckZ4FM9iPz6SZENK7MTtDgzDkEpJm~CctHKjifdl8jlTCqt6Rrz0-sC9zAJvbQjG7tw2mDk~7UQzDjTOK0kU51Sq6qN9yjsB~f4nDaz8WHcBz-nbqSSAnLcrgRx3aVA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40882055/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40882055/mini_magick20190220-18240-1xfsg9s.png?1550674621"}],"downloadable_attachments_with_full_thumbnails":[{"id":40882055,"asset_id":19856112,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40882055/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40882055/_28sici_291099-1425_28199901_2F02_292_3A1_3C35_3A_3Aaid-jos15_3E3.0.co_3B2-j-libre.pdf20151227-2777-tkya5?1451251763=\u0026response-content-disposition=attachment%3B+filename%3DCyclic_scheduling_in_3_machine_robotic_f.pdf\u0026Expires=1740096573\u0026Signature=XDw31gUqSyDFFcdV2JE9kJuabAypntjynCHAs0jjKuZ7yaAeVxaqJF~GLW3T0C8hX-c20PdJLjhNq2bqWBxlGlIPVPhma4o7C~WWDJflCoNS4MYpgPPnz0BNEmbIGsPGioFRMZAoHAYGDzm6y4TRUctN9Y65ewymOGxJQq3IJAH5ZpV2L~dswrONXC5Wm5G27MXbi-Ik4SVmdoscZXHRcVUckZ4FM9iPz6SZENK7MTtDgzDkEpJm~CctHKjifdl8jlTCqt6Rrz0-sC9zAJvbQjG7tw2mDk~7UQzDjTOK0kU51Sq6qN9yjsB~f4nDaz8WHcBz-nbqSSAnLcrgRx3aVA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40882055/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40882055/mini_magick20190220-18240-1xfsg9s.png?1550674621"}],"has_pdf":true,"has_fulltext":true,"page_count":20,"ordered_authors":[{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics","nofollow":true},{"id":9048,"name":"Scheduling","url":"https://www.academia.edu/Documents/in/Scheduling","nofollow":true},{"id":73149,"name":"Business and Management","url":"https://www.academia.edu/Documents/in/Business_and_Management","nofollow":true},{"id":556845,"name":"Numerical Analysis and Computational Mathematics","url":"https://www.academia.edu/Documents/in/Numerical_Analysis_and_Computational_Mathematics","nofollow":true}],"publication_year":1999,"publication_year_with_fallback":1999,"paper_rank":null,"all_time_views":21,"active_discussion":{}}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19856113" data-work_id="19856113" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19856113/ASAP_The_After_Salesman_Problem">ASAP: The After-Salesman Problem</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The customer contacts taking place after a sales transaction and the services involved are of increasing importance in contemporary business models. The responsiveness to service requests is a key dimension in service quality and... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19856113" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The customer contacts taking place after a sales transaction and the services involved are of increasing importance in contemporary business models. The responsiveness to service requests is a key dimension in service quality and therefore an important succes factor in this business domain. This responsiveness is of course highly dependent on the operational scheduling or dispatching decisions made in the often dynamic service settings. We consider the problem of optimizing responsiveness to service requests arriving in real time. We consider three models and formulations and present computational results on exact solution methods. The research is based on practical practical work done with the largest service organization in The Netherlands.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19856113" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="647f137c85dda2a707d17f877da04872" rel="nofollow" data-download="{"attachment_id":41282787,"asset_id":19856113,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/41282787/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40651073" href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a><script data-card-contents-for-user="40651073" type="text/json">{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_19856113 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19856113"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19856113, container: ".js-paper-rank-work_19856113", }); });</script></li><li class="js-percentile-work_19856113 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19856113; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19856113"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19856113 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19856113"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19856113; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19856113]").text(description); $(".js-view-count-work_19856113").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19856113").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19856113"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">6</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="39" rel="nofollow" href="https://www.academia.edu/Documents/in/Marketing">Marketing</a>, <script data-card-contents-for-ri="39" type="text/json">{"id":39,"name":"Marketing","url":"https://www.academia.edu/Documents/in/Marketing","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="305" rel="nofollow" href="https://www.academia.edu/Documents/in/Applied_Mathematics">Applied Mathematics</a>, <script data-card-contents-for-ri="305" type="text/json">{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="5628" rel="nofollow" href="https://www.academia.edu/Documents/in/Service_Quality">Service Quality</a>, <script data-card-contents-for-ri="5628" type="text/json">{"id":5628,"name":"Service Quality","url":"https://www.academia.edu/Documents/in/Service_Quality","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="73149" rel="nofollow" href="https://www.academia.edu/Documents/in/Business_and_Management">Business and Management</a><script data-card-contents-for-ri="73149" type="text/json">{"id":73149,"name":"Business and Management","url":"https://www.academia.edu/Documents/in/Business_and_Management","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19856113]'), work: {"id":19856113,"title":"ASAP: The After-Salesman Problem","created_at":"2015-12-27T13:27:00.173-08:00","owner_id":40651073,"url":"https://www.academia.edu/19856113/ASAP_The_After_Salesman_Problem","slug":"ASAP_The_After_Salesman_Problem","dom_id":"work_19856113","summary":"The customer contacts taking place after a sales transaction and the services involved are of increasing importance in contemporary business models. The responsiveness to service requests is a key dimension in service quality and therefore an important succes factor in this business domain. This responsiveness is of course highly dependent on the operational scheduling or dispatching decisions made in the often dynamic service settings. We consider the problem of optimizing responsiveness to service requests arriving in real time. We consider three models and formulations and present computational results on exact solution methods. The research is based on practical practical work done with the largest service organization in The Netherlands.","publication":"Manufacturing \u0026 Service Operations Management","publication_with_fallback":"Manufacturing \u0026 Service Operations Management","downloadable_attachments":[{"id":41282787,"asset_id":19856113,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/41282787/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/41282787/ASAP_the_after-salesman_problem20160117-30660-1l3detg-libre.pdf?1453020987=\u0026response-content-disposition=attachment%3B+filename%3DASAP_The_After_Salesman_Problem.pdf\u0026Expires=1740154567\u0026Signature=FWT7h9F8UziUqBECBlHmBfRDAhff4ncSgcupgQH5zt32rl-5uRnrHdzssVM16RJxban8WbQUkFgVSz67fvtFbCweZyeIkpl4JTm6JWVxeRZC-2gay9QkV-mfRQePVKSBI9-8yWsUqVtMfJ4fb0IagDSZ0plWzQj-2XaP2-hYJ3dNRmHOoG5B8xodRfTt8wARYzWshxS-PQXlQigiNx84UjzYD881TZ8KEZBTBCpXECtqhK5FbtRl1aQkbPr2pUFMN9o2bzUwm3P1uRU~fGimDPcmdO4NIuAYeO5xPN1Hs-hnS6bOBDJ9wyL9lTNQMq6DXn-G4cGT37IEYAWoAXEXRg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/41282787/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/41282787/mini_magick20190219-7681-1gkfn0m.png?1550615003"}],"downloadable_attachments_with_full_thumbnails":[{"id":41282787,"asset_id":19856113,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/41282787/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/41282787/ASAP_the_after-salesman_problem20160117-30660-1l3detg-libre.pdf?1453020987=\u0026response-content-disposition=attachment%3B+filename%3DASAP_The_After_Salesman_Problem.pdf\u0026Expires=1740154567\u0026Signature=FWT7h9F8UziUqBECBlHmBfRDAhff4ncSgcupgQH5zt32rl-5uRnrHdzssVM16RJxban8WbQUkFgVSz67fvtFbCweZyeIkpl4JTm6JWVxeRZC-2gay9QkV-mfRQePVKSBI9-8yWsUqVtMfJ4fb0IagDSZ0plWzQj-2XaP2-hYJ3dNRmHOoG5B8xodRfTt8wARYzWshxS-PQXlQigiNx84UjzYD881TZ8KEZBTBCpXECtqhK5FbtRl1aQkbPr2pUFMN9o2bzUwm3P1uRU~fGimDPcmdO4NIuAYeO5xPN1Hs-hnS6bOBDJ9wyL9lTNQMq6DXn-G4cGT37IEYAWoAXEXRg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/41282787/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/41282787/mini_magick20190219-7681-1gkfn0m.png?1550615003"}],"has_pdf":true,"has_fulltext":true,"page_count":35,"ordered_authors":[{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":39,"name":"Marketing","url":"https://www.academia.edu/Documents/in/Marketing","nofollow":true},{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics","nofollow":true},{"id":5628,"name":"Service Quality","url":"https://www.academia.edu/Documents/in/Service_Quality","nofollow":true},{"id":73149,"name":"Business and Management","url":"https://www.academia.edu/Documents/in/Business_and_Management","nofollow":true},{"id":286064,"name":"Manufacturing and Service Operations Management","url":"https://www.academia.edu/Documents/in/Manufacturing_and_Service_Operations_Management"},{"id":1868639,"name":"Exact solution methods","url":"https://www.academia.edu/Documents/in/Exact_solution_methods"}],"publication_year":2010,"publication_year_with_fallback":2010,"paper_rank":null,"all_time_views":13,"active_discussion":{}}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19856114" data-work_id="19856114" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19856114/Worst_case_performance_of_approximation_algorithms_for_tool_management_problems">Worst‐case performance of approximation algorithms for tool management problems</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Since the introduction of flexible manufacturing systems, researchers have investigated various planning and scheduling problems faced by the users of such systems. Several of these problems are not encountered in more classical... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19856114" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Since the introduction of flexible manufacturing systems, researchers have investigated various planning and scheduling problems faced by the users of such systems. Several of these problems are not encountered in more classical production settings, and so-called tool management problems appear to be among the more fundamental ones of these problems. Most tool management problems are hard to solve, so that numerous approximate solution techniques have been proposed to tackle them. In this paper, we investigate the quality of such algorithms by means of worst-case analysis. We consider several polynomial-time approximation algorithms described in the literature, and we show that all these algorithms exhibit rather poor worst-case behavior. We also study the complexity of solving tool management problems approximately. In this respect, we investigate the interrelationships among tool management problems, as well as their relationships with other well-known combinatorial problems such as the maximum clique problem or the set covering problem, and we prove several negative results on the approximability of various tool management problems.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19856114" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="bcf6f7ad0f598eb17a5b0d190597bc2a" rel="nofollow" data-download="{"attachment_id":40882056,"asset_id":19856114,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/40882056/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40651073" href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a><script data-card-contents-for-user="40651073" type="text/json">{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_19856114 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19856114"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19856114, container: ".js-paper-rank-work_19856114", }); });</script></li><li class="js-percentile-work_19856114 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19856114; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19856114"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19856114 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19856114"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19856114; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19856114]").text(description); $(".js-view-count-work_19856114").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19856114").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19856114"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">6</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="305" rel="nofollow" href="https://www.academia.edu/Documents/in/Applied_Mathematics">Applied Mathematics</a>, <script data-card-contents-for-ri="305" type="text/json">{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="13975" rel="nofollow" href="https://www.academia.edu/Documents/in/Contract">Contract</a>, <script data-card-contents-for-ri="13975" type="text/json">{"id":13975,"name":"Contract","url":"https://www.academia.edu/Documents/in/Contract","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="73149" rel="nofollow" href="https://www.academia.edu/Documents/in/Business_and_Management">Business and Management</a>, <script data-card-contents-for-ri="73149" type="text/json">{"id":73149,"name":"Business and Management","url":"https://www.academia.edu/Documents/in/Business_and_Management","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="308820" rel="nofollow" href="https://www.academia.edu/Documents/in/Naval_Logistics">Naval Logistics</a><script data-card-contents-for-ri="308820" type="text/json">{"id":308820,"name":"Naval Logistics","url":"https://www.academia.edu/Documents/in/Naval_Logistics","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19856114]'), work: {"id":19856114,"title":"Worst‐case performance of approximation algorithms for tool management problems","created_at":"2015-12-27T13:27:00.248-08:00","owner_id":40651073,"url":"https://www.academia.edu/19856114/Worst_case_performance_of_approximation_algorithms_for_tool_management_problems","slug":"Worst_case_performance_of_approximation_algorithms_for_tool_management_problems","dom_id":"work_19856114","summary":"Since the introduction of flexible manufacturing systems, researchers have investigated various planning and scheduling problems faced by the users of such systems. Several of these problems are not encountered in more classical production settings, and so-called tool management problems appear to be among the more fundamental ones of these problems. Most tool management problems are hard to solve, so that numerous approximate solution techniques have been proposed to tackle them. In this paper, we investigate the quality of such algorithms by means of worst-case analysis. We consider several polynomial-time approximation algorithms described in the literature, and we show that all these algorithms exhibit rather poor worst-case behavior. We also study the complexity of solving tool management problems approximately. In this respect, we investigate the interrelationships among tool management problems, as well as their relationships with other well-known combinatorial problems such as the maximum clique problem or the set covering problem, and we prove several negative results on the approximability of various tool management problems.","publication":"Naval Research Logistics","publication_with_fallback":"Naval Research Logistics","downloadable_attachments":[{"id":40882056,"asset_id":19856114,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40882056/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40882056/_28sici_291520-6750_28199908_2946_3A5_3C445_3A_3Aaid-nav1_3E3.0.co_3B2-r-libre.pdf20151227-4344-1y82853?1451251763=\u0026response-content-disposition=attachment%3B+filename%3DWorst_case_performance_of_approximation.pdf\u0026Expires=1740096574\u0026Signature=GXgmhMZMUYGlK6iwZrFAB7DLpus2fW65nVdlav5H2Ssi9Oaj7ksEcpjaS9WGEA8TEW7QLkkOUqT2EIoIwxLacRBRZG2tdOuv0gjmq8OA6RaaWoek6a9QC7mz8xPuKnXDYOyRCC5Snl1-HsLLUKLVagLQVLBDu~JPbiVgtqk~LLORV~d8bfIR9k2Ys-Htg3EBxXcY-ndPfpfeHcEU0FSuzpxodWYkciIEdm56aiRPcgGVBYvOcN~av4FAzV7mmTkAyfDH-jPsQuX0rGM2KJVTBaxFjQiNmpYja2hopo7HNioyGbrIJMsbhoQoQzBx4K-cbCz4VHoZ72EyJEqxYP-8~Q__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40882056/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40882056/mini_magick20190220-8750-7hjma2.png?1550674632"}],"downloadable_attachments_with_full_thumbnails":[{"id":40882056,"asset_id":19856114,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40882056/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40882056/_28sici_291520-6750_28199908_2946_3A5_3C445_3A_3Aaid-nav1_3E3.0.co_3B2-r-libre.pdf20151227-4344-1y82853?1451251763=\u0026response-content-disposition=attachment%3B+filename%3DWorst_case_performance_of_approximation.pdf\u0026Expires=1740096574\u0026Signature=GXgmhMZMUYGlK6iwZrFAB7DLpus2fW65nVdlav5H2Ssi9Oaj7ksEcpjaS9WGEA8TEW7QLkkOUqT2EIoIwxLacRBRZG2tdOuv0gjmq8OA6RaaWoek6a9QC7mz8xPuKnXDYOyRCC5Snl1-HsLLUKLVagLQVLBDu~JPbiVgtqk~LLORV~d8bfIR9k2Ys-Htg3EBxXcY-ndPfpfeHcEU0FSuzpxodWYkciIEdm56aiRPcgGVBYvOcN~av4FAzV7mmTkAyfDH-jPsQuX0rGM2KJVTBaxFjQiNmpYja2hopo7HNioyGbrIJMsbhoQoQzBx4K-cbCz4VHoZ72EyJEqxYP-8~Q__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40882056/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40882056/mini_magick20190220-8750-7hjma2.png?1550674632"}],"has_pdf":true,"has_fulltext":true,"page_count":18,"ordered_authors":[{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics","nofollow":true},{"id":13975,"name":"Contract","url":"https://www.academia.edu/Documents/in/Contract","nofollow":true},{"id":73149,"name":"Business and Management","url":"https://www.academia.edu/Documents/in/Business_and_Management","nofollow":true},{"id":308820,"name":"Naval Logistics","url":"https://www.academia.edu/Documents/in/Naval_Logistics","nofollow":true},{"id":556845,"name":"Numerical Analysis and Computational Mathematics","url":"https://www.academia.edu/Documents/in/Numerical_Analysis_and_Computational_Mathematics"},{"id":559962,"name":"Approximate Algorithm","url":"https://www.academia.edu/Documents/in/Approximate_Algorithm"}],"publication_year":1999,"publication_year_with_fallback":1999,"paper_rank":null,"all_time_views":5,"active_discussion":{}}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19856115" data-work_id="19856115" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19856115/Basic_scheduling_problems_with_raw_material_constraints">Basic scheduling problems with raw material constraints</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">One of the achievements of scheduling theory is its contribution to practical applications in industrial settings. In particular, taking finiteness of the available production capacity explicitly into account, has been a major improvement... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19856115" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">One of the achievements of scheduling theory is its contribution to practical applications in industrial settings. In particular, taking finiteness of the available production capacity explicitly into account, has been a major improvement of standard practice. Availability of raw materials, however, which is another important constraint in practice, has been largely disregarded in scheduling theory. This paper considers basic models for scheduling problems in contemporary manufacturing settings where raw material availability is of critical importance. We explore single scheduling machine problems, mostly with unit or all equal processing times, and Lmax and Cmax objectives. We present polynomial time algorithms, complexity and approximation results, and computational experiments.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19856115" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="c311d51eecd2f34f0698998478ff3478" rel="nofollow" data-download="{"attachment_id":41282341,"asset_id":19856115,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/41282341/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40651073" href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a><script data-card-contents-for-user="40651073" type="text/json">{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_19856115 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19856115"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19856115, container: ".js-paper-rank-work_19856115", }); });</script></li><li class="js-percentile-work_19856115 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19856115; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19856115"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19856115 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19856115"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19856115; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19856115]").text(description); $(".js-view-count-work_19856115").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19856115").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19856115"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">6</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="305" rel="nofollow" href="https://www.academia.edu/Documents/in/Applied_Mathematics">Applied Mathematics</a>, <script data-card-contents-for-ri="305" type="text/json">{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="73149" rel="nofollow" href="https://www.academia.edu/Documents/in/Business_and_Management">Business and Management</a>, <script data-card-contents-for-ri="73149" type="text/json">{"id":73149,"name":"Business and Management","url":"https://www.academia.edu/Documents/in/Business_and_Management","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="80691" rel="nofollow" href="https://www.academia.edu/Documents/in/Raw_materials">Raw materials</a>, <script data-card-contents-for-ri="80691" type="text/json">{"id":80691,"name":"Raw materials","url":"https://www.academia.edu/Documents/in/Raw_materials","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="265899" rel="nofollow" href="https://www.academia.edu/Documents/in/Scheduling_Theory">Scheduling Theory</a><script data-card-contents-for-ri="265899" type="text/json">{"id":265899,"name":"Scheduling Theory","url":"https://www.academia.edu/Documents/in/Scheduling_Theory","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19856115]'), work: {"id":19856115,"title":"Basic scheduling problems with raw material constraints","created_at":"2015-12-27T13:27:00.332-08:00","owner_id":40651073,"url":"https://www.academia.edu/19856115/Basic_scheduling_problems_with_raw_material_constraints","slug":"Basic_scheduling_problems_with_raw_material_constraints","dom_id":"work_19856115","summary":"One of the achievements of scheduling theory is its contribution to practical applications in industrial settings. In particular, taking finiteness of the available production capacity explicitly into account, has been a major improvement of standard practice. Availability of raw materials, however, which is another important constraint in practice, has been largely disregarded in scheduling theory. This paper considers basic models for scheduling problems in contemporary manufacturing settings where raw material availability is of critical importance. We explore single scheduling machine problems, mostly with unit or all equal processing times, and Lmax and Cmax objectives. We present polynomial time algorithms, complexity and approximation results, and computational experiments.","publication":"Naval Research Logistics","publication_with_fallback":"Naval Research Logistics","downloadable_attachments":[{"id":41282341,"asset_id":19856115,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/41282341/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/41282341/Basic_scheduling_problems_with_raw_mater20160117-25704-1uckqik-libre.pdf?1453019056=\u0026response-content-disposition=attachment%3B+filename%3DBasic_scheduling_problems_with_raw_mater.pdf\u0026Expires=1740154567\u0026Signature=JwUHOGgRhqgWD6LYD~frkngdzBfxbPBhjxQQbu~N3xHLC9-clLU5pDp0HuTvvgc9wyXWDgltyhNynTqcee4ejfZkdMpBO2lYhDPTT2y6lMG1BPvExlXWqAZ5AygCDleAIcK63uKS~fG9kecmfNG9dZ4jy9HyhVqu566ZqsRyf8lLB1Yq8NnOc5Ht-GOlA4wRsI~dWwJFyjkmOpvvEPH1mWvIDdXh5dqOgaDEhF~ZLdUVqGz4AwIa30pB4zsIxmEIFnpOzkuD7H6I7Y7bEtdHdplMLuGilMyO5zOVWApFZa-6pBqdZ~ST1n2DwyIvuvgUoGQ9DhJsyuzf0JDjH88tyw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/41282341/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/41282341/mini_magick20190219-25311-lsefrm.png?1550615066"}],"downloadable_attachments_with_full_thumbnails":[{"id":41282341,"asset_id":19856115,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/41282341/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/41282341/Basic_scheduling_problems_with_raw_mater20160117-25704-1uckqik-libre.pdf?1453019056=\u0026response-content-disposition=attachment%3B+filename%3DBasic_scheduling_problems_with_raw_mater.pdf\u0026Expires=1740154567\u0026Signature=JwUHOGgRhqgWD6LYD~frkngdzBfxbPBhjxQQbu~N3xHLC9-clLU5pDp0HuTvvgc9wyXWDgltyhNynTqcee4ejfZkdMpBO2lYhDPTT2y6lMG1BPvExlXWqAZ5AygCDleAIcK63uKS~fG9kecmfNG9dZ4jy9HyhVqu566ZqsRyf8lLB1Yq8NnOc5Ht-GOlA4wRsI~dWwJFyjkmOpvvEPH1mWvIDdXh5dqOgaDEhF~ZLdUVqGz4AwIa30pB4zsIxmEIFnpOzkuD7H6I7Y7bEtdHdplMLuGilMyO5zOVWApFZa-6pBqdZ~ST1n2DwyIvuvgUoGQ9DhJsyuzf0JDjH88tyw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/41282341/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/41282341/mini_magick20190219-25311-lsefrm.png?1550615066"}],"has_pdf":true,"has_fulltext":true,"page_count":14,"ordered_authors":[{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics","nofollow":true},{"id":73149,"name":"Business and Management","url":"https://www.academia.edu/Documents/in/Business_and_Management","nofollow":true},{"id":80691,"name":"Raw materials","url":"https://www.academia.edu/Documents/in/Raw_materials","nofollow":true},{"id":265899,"name":"Scheduling Theory","url":"https://www.academia.edu/Documents/in/Scheduling_Theory","nofollow":true},{"id":308820,"name":"Naval Logistics","url":"https://www.academia.edu/Documents/in/Naval_Logistics"},{"id":556845,"name":"Numerical Analysis and Computational Mathematics","url":"https://www.academia.edu/Documents/in/Numerical_Analysis_and_Computational_Mathematics"}],"publication_year":2005,"publication_year_with_fallback":2005,"paper_rank":null,"all_time_views":16,"active_discussion":{}}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19856116" data-work_id="19856116" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19856116/Cyclic_Scheduling_of_Identical_Parts_in_a_Robotic_Cell">Cyclic Scheduling of Identical Parts in a Robotic Cell</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">We consider a robotic flowshop in which one type of product is to be repeatedly produced, and where transportation of the parts between the machines is performed by a robot. The identical parts cyclic scheduling problem is then to find a... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19856116" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">We consider a robotic flowshop in which one type of product is to be repeatedly produced, and where transportation of the parts between the machines is performed by a robot. The identical parts cyclic scheduling problem is then to find a shortest cyclic schedule for the robot; i.e., a sequence of robot moves that can be infinitely repeated and that has minimum cycle time. This problem has been solved by Sethi et al. (1992) when m < 3. In this paper, we generalize their results by proving that the identical parts cyclic scheduling problem can be solved in time polynomial in m, where m denotes the number of. machines in the shop. In particular, we present a dynamic programming approach that allows us to solve the problem in 0(m3) time. Our analysis relies heavily on the concept of pyramidal permutation, a concept previously investigated in connection with the traveling salesman problem.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19856116" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="88947ded3390e622dc458c2b96f71d6d" rel="nofollow" data-download="{"attachment_id":41282763,"asset_id":19856116,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/41282763/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40651073" href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a><script data-card-contents-for-user="40651073" type="text/json">{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_19856116 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19856116"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19856116, container: ".js-paper-rank-work_19856116", }); });</script></li><li class="js-percentile-work_19856116 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19856116; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19856116"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19856116 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19856116"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19856116; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19856116]").text(description); $(".js-view-count-work_19856116").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19856116").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19856116"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">3</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="305" rel="nofollow" href="https://www.academia.edu/Documents/in/Applied_Mathematics">Applied Mathematics</a>, <script data-card-contents-for-ri="305" type="text/json">{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="73149" rel="nofollow" href="https://www.academia.edu/Documents/in/Business_and_Management">Business and Management</a>, <script data-card-contents-for-ri="73149" type="text/json">{"id":73149,"name":"Business and Management","url":"https://www.academia.edu/Documents/in/Business_and_Management","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="249496" rel="nofollow" href="https://www.academia.edu/Documents/in/Operations">Operations</a><script data-card-contents-for-ri="249496" type="text/json">{"id":249496,"name":"Operations","url":"https://www.academia.edu/Documents/in/Operations","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19856116]'), work: {"id":19856116,"title":"Cyclic Scheduling of Identical Parts in a Robotic Cell","created_at":"2015-12-27T13:27:00.416-08:00","owner_id":40651073,"url":"https://www.academia.edu/19856116/Cyclic_Scheduling_of_Identical_Parts_in_a_Robotic_Cell","slug":"Cyclic_Scheduling_of_Identical_Parts_in_a_Robotic_Cell","dom_id":"work_19856116","summary":"We consider a robotic flowshop in which one type of product is to be repeatedly produced, and where transportation of the parts between the machines is performed by a robot. The identical parts cyclic scheduling problem is then to find a shortest cyclic schedule for the robot; i.e., a sequence of robot moves that can be infinitely repeated and that has minimum cycle time. This problem has been solved by Sethi et al. (1992) when m \u003c 3. In this paper, we generalize their results by proving that the identical parts cyclic scheduling problem can be solved in time polynomial in m, where m denotes the number of. machines in the shop. In particular, we present a dynamic programming approach that allows us to solve the problem in 0(m3) time. Our analysis relies heavily on the concept of pyramidal permutation, a concept previously investigated in connection with the traveling salesman problem.","publication":"Operations Research","publication_with_fallback":"Operations Research","downloadable_attachments":[{"id":41282763,"asset_id":19856116,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/41282763/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/41282763/Cyclic_Scheduling_of_Identical_Parts_in_20160117-6714-yadydx-libre.pdf?1453020917=\u0026response-content-disposition=attachment%3B+filename%3DCyclic_Scheduling_of_Identical_Parts_in.pdf\u0026Expires=1740096574\u0026Signature=fR00hjWeLMyS5ilZae4RkqiduU~PXSFFy7h8CPpbtw7IKdKCUyN9ZgZ0PeV~~fSb4s4CqWMPgLOOgFHLji5eOIxULC9baQL1mJ2nvLYJ8hkCqUeGMVuXEJiTcBQ2u2pOzpYa9Gg4lSI5RtDMt4oSGXeD6c33MNkVXUBSzV~0Coo2dKtQACuVY4UnWxiHB5sToN25CVA2QbTin5T7rGr7gsnHKlmOpLdonJ-SzrhLZ8s6iS8qOv0~tVqkNVC9reBaOSYJLCwvFgn8KwqZa~jiY-zy~1gtKSRSsExKLuLV8LnvOO-xeXNKla1qzgvaLi9xBx0-AM~tq2aEw9VUrNVmXw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/41282763/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/41282763/mini_magick20190219-25311-vbqwbb.png?1550615021"}],"downloadable_attachments_with_full_thumbnails":[{"id":41282763,"asset_id":19856116,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/41282763/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/41282763/Cyclic_Scheduling_of_Identical_Parts_in_20160117-6714-yadydx-libre.pdf?1453020917=\u0026response-content-disposition=attachment%3B+filename%3DCyclic_Scheduling_of_Identical_Parts_in.pdf\u0026Expires=1740096574\u0026Signature=fR00hjWeLMyS5ilZae4RkqiduU~PXSFFy7h8CPpbtw7IKdKCUyN9ZgZ0PeV~~fSb4s4CqWMPgLOOgFHLji5eOIxULC9baQL1mJ2nvLYJ8hkCqUeGMVuXEJiTcBQ2u2pOzpYa9Gg4lSI5RtDMt4oSGXeD6c33MNkVXUBSzV~0Coo2dKtQACuVY4UnWxiHB5sToN25CVA2QbTin5T7rGr7gsnHKlmOpLdonJ-SzrhLZ8s6iS8qOv0~tVqkNVC9reBaOSYJLCwvFgn8KwqZa~jiY-zy~1gtKSRSsExKLuLV8LnvOO-xeXNKla1qzgvaLi9xBx0-AM~tq2aEw9VUrNVmXw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/41282763/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/41282763/mini_magick20190219-25311-vbqwbb.png?1550615021"}],"has_pdf":true,"has_fulltext":true,"page_count":14,"ordered_authors":[{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics","nofollow":true},{"id":73149,"name":"Business and Management","url":"https://www.academia.edu/Documents/in/Business_and_Management","nofollow":true},{"id":249496,"name":"Operations","url":"https://www.academia.edu/Documents/in/Operations","nofollow":true}],"publication_year":1997,"publication_year_with_fallback":1997,"paper_rank":null,"all_time_views":20,"active_discussion":{}}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19856117" data-work_id="19856117" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19856117/ANWB_automates_and_improves_repair_men_dispatching">ANWB automates and improves repair men dispatching</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">ANWB, the Dutch automobile association, provides assistance, car repair andreplacement services to its nearly 4 million members. ANWB services around 1.3 millionrequests per year in The Netherlands. Historically, the operational planning... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19856117" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">ANWB, the Dutch automobile association, provides assistance, car repair andreplacement services to its nearly 4 million members. ANWB services around 1.3 millionrequests per year in The Netherlands. Historically, the operational planning process ofassigning requests to service men was regionally organized, and human planners solvedthe sometimes large and hectic planning situations in real time. At a national level, some50 planners were required to do the job, and the quality of the planning and operationswere largely unknown. In a large business process reengineering project, ANWBredesigned the planning processes, leveraging state of the art IT and operations researchtechniques. As a result, the 24/7 planning processes are smoothened, can be executed byas few as 14 planners who work at a national level, and the operational planning andperformance have improved. As new competitors entered the market, ANWB has beenable to sustain its extraordinary high customer ratings and market shar...</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19856117" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="efcd962fa6f2a07b409688db5c7ce5ee" rel="nofollow" data-download="{"attachment_id":40882047,"asset_id":19856117,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/40882047/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40651073" href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a><script data-card-contents-for-user="40651073" type="text/json">{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_19856117 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19856117"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19856117, container: ".js-paper-rank-work_19856117", }); });</script></li><li class="js-percentile-work_19856117 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19856117; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19856117"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19856117 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19856117"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19856117; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19856117]").text(description); $(".js-view-count-work_19856117").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19856117").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19856117"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i></div><span class="InlineList-item-text u-textTruncate u-pl6x"><a class="InlineList-item-text" data-has-card-for-ri="340132" rel="nofollow" href="https://www.academia.edu/Documents/in/Business_process_reengineering">Business process reengineering</a><script data-card-contents-for-ri="340132" type="text/json">{"id":340132,"name":"Business process reengineering","url":"https://www.academia.edu/Documents/in/Business_process_reengineering","nofollow":true}</script></span></li><script>(function(){ if (false) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19856117]'), work: {"id":19856117,"title":"ANWB automates and improves repair men dispatching","created_at":"2015-12-27T13:27:00.508-08:00","owner_id":40651073,"url":"https://www.academia.edu/19856117/ANWB_automates_and_improves_repair_men_dispatching","slug":"ANWB_automates_and_improves_repair_men_dispatching","dom_id":"work_19856117","summary":"ANWB, the Dutch automobile association, provides assistance, car repair andreplacement services to its nearly 4 million members. ANWB services around 1.3 millionrequests per year in The Netherlands. Historically, the operational planning process ofassigning requests to service men was regionally organized, and human planners solvedthe sometimes large and hectic planning situations in real time. At a national level, some50 planners were required to do the job, and the quality of the planning and operationswere largely unknown. In a large business process reengineering project, ANWBredesigned the planning processes, leveraging state of the art IT and operations researchtechniques. As a result, the 24/7 planning processes are smoothened, can be executed byas few as 14 planners who work at a national level, and the operational planning andperformance have improved. As new competitors entered the market, ANWB has beenable to sustain its extraordinary high customer ratings and market shar...","publication":"International Journal of Cancer - INT J CANCER","publication_with_fallback":"International Journal of Cancer - INT J CANCER","downloadable_attachments":[{"id":40882047,"asset_id":19856117,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40882047/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40882047/file-libre.pdf?1451251640=\u0026response-content-disposition=attachment%3B+filename%3DANWB_automates_and_improves_repair_men_d.pdf\u0026Expires=1740154567\u0026Signature=eUz~anHgrdMOC35HOD3KLvg2ZHQMRok-6UYc8951CmexkwfbBQBm2Wqv8Z2ykdHLAz1ZCB7u0r3lR8mbpoXJ41tGKpf9tCaL9V3RxuDHgrH7OGMBG253rHW6i-lD4NxCJoG-XzTwdNAW219wtk7zQKCD07EbZNI8sSYccjyV2W7DrzCSyMEGFgNbrwIbnzw~AUgBJCi7z6h~PLbw2ZsK5cNwMBFHKa2hKJ8C~Yhd7ZiXEQCPMeGNtlETbpjobr7e9Z35hIb4FAChdcB6NSa4V5nysbNy5nh~31ifP~9m9S7K51rA-Qszk2VfqjnOloASz867qSYxAeFbeQrm-ZTRMA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40882047/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40882047/mini_magick20190220-14353-xfp337.png?1550674636"}],"downloadable_attachments_with_full_thumbnails":[{"id":40882047,"asset_id":19856117,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40882047/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40882047/file-libre.pdf?1451251640=\u0026response-content-disposition=attachment%3B+filename%3DANWB_automates_and_improves_repair_men_d.pdf\u0026Expires=1740154567\u0026Signature=eUz~anHgrdMOC35HOD3KLvg2ZHQMRok-6UYc8951CmexkwfbBQBm2Wqv8Z2ykdHLAz1ZCB7u0r3lR8mbpoXJ41tGKpf9tCaL9V3RxuDHgrH7OGMBG253rHW6i-lD4NxCJoG-XzTwdNAW219wtk7zQKCD07EbZNI8sSYccjyV2W7DrzCSyMEGFgNbrwIbnzw~AUgBJCi7z6h~PLbw2ZsK5cNwMBFHKa2hKJ8C~Yhd7ZiXEQCPMeGNtlETbpjobr7e9Z35hIb4FAChdcB6NSa4V5nysbNy5nh~31ifP~9m9S7K51rA-Qszk2VfqjnOloASz867qSYxAeFbeQrm-ZTRMA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40882047/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40882047/mini_magick20190220-14353-xfp337.png?1550674636"}],"has_pdf":true,"has_fulltext":true,"page_count":20,"ordered_authors":[{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":340132,"name":"Business process reengineering","url":"https://www.academia.edu/Documents/in/Business_process_reengineering","nofollow":true}],"publication_year":2008,"publication_year_with_fallback":2008,"paper_rank":null,"all_time_views":30,"active_discussion":{}}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19856118 coauthored" data-work_id="19856118" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19856118/Telecommunication_carrier_selection_under_volume_discounts_a_case_study">Telecommunication carrier selection under volume discounts: a case study</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">During 2001 many of the European mobile phone markets have reached saturation, and hence mobile phone operators have shifted their attention from growth and market share to cutting costs. One way of doing so is to reduce spending on... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19856118" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">During 2001 many of the European mobile phone markets have reached saturation, and hence mobile phone operators have shifted their attention from growth and market share to cutting costs. One way of doing so is to reduce spending on international calls which are routed via network operating companies (carriers). These carriers charge per call-minute for each destination and may use a joint business volume discount to price their services. We developed a software system that supports the decision of allocating destinations to carriers. The core of this system is a min-cost flow routine that is embedded in a branch-and-bound framework. Our system not only solves the operational problem to optimality, it is also capable of performing what-if analyses and sensitivity analysis. It has been implemented at a major telecommunication services provider. The main benefits realized are twofold: the business process of allocating carriers to destinations has been structured and the costs arising...</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19856118" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="73cd4d113315eaecb6d80f61096619bf" rel="nofollow" data-download="{"attachment_id":42006193,"asset_id":19856118,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/42006193/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40651073" href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a><script data-card-contents-for-user="40651073" type="text/json">{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-19856118">+1</span><div class="hidden js-additional-users-19856118"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://kuleuven.academia.edu/FritsSpieksma">Frits Spieksma</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-19856118'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-19856118').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_19856118 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19856118"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19856118, container: ".js-paper-rank-work_19856118", }); });</script></li><li class="js-percentile-work_19856118 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19856118; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19856118"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19856118 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19856118"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19856118; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19856118]").text(description); $(".js-view-count-work_19856118").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19856118").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19856118"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">3</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="217280" rel="nofollow" href="https://www.academia.edu/Documents/in/Mobile_phone">Mobile phone</a>, <script data-card-contents-for-ri="217280" type="text/json">{"id":217280,"name":"Mobile phone","url":"https://www.academia.edu/Documents/in/Mobile_phone","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="246900" rel="nofollow" href="https://www.academia.edu/Documents/in/Business_Process">Business Process</a>, <script data-card-contents-for-ri="246900" type="text/json">{"id":246900,"name":"Business Process","url":"https://www.academia.edu/Documents/in/Business_Process","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="466041" rel="nofollow" href="https://www.academia.edu/Documents/in/Market_Share">Market Share</a><script data-card-contents-for-ri="466041" type="text/json">{"id":466041,"name":"Market Share","url":"https://www.academia.edu/Documents/in/Market_Share","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19856118]'), work: {"id":19856118,"title":"Telecommunication carrier selection under volume discounts: a case study","created_at":"2015-12-27T13:27:00.672-08:00","owner_id":40651073,"url":"https://www.academia.edu/19856118/Telecommunication_carrier_selection_under_volume_discounts_a_case_study","slug":"Telecommunication_carrier_selection_under_volume_discounts_a_case_study","dom_id":"work_19856118","summary":"During 2001 many of the European mobile phone markets have reached saturation, and hence mobile phone operators have shifted their attention from growth and market share to cutting costs. One way of doing so is to reduce spending on international calls which are routed via network operating companies (carriers). These carriers charge per call-minute for each destination and may use a joint business volume discount to price their services. We developed a software system that supports the decision of allocating destinations to carriers. The core of this system is a min-cost flow routine that is embedded in a branch-and-bound framework. Our system not only solves the operational problem to optimality, it is also capable of performing what-if analyses and sensitivity analysis. It has been implemented at a major telecommunication services provider. The main benefits realized are twofold: the business process of allocating carriers to destinations has been structured and the costs arising...","publication":null,"publication_with_fallback":null,"downloadable_attachments":[{"id":42006193,"asset_id":19856118,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/42006193/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/42006193/OR_0330-libre.pdf?1454556636=\u0026response-content-disposition=attachment%3B+filename%3DTelecommunication_carrier_selection_unde.pdf\u0026Expires=1740096574\u0026Signature=Dcv7Rh8HGoumQ57n7OKv8V3QN4Ka23vXl87-58kytLATwHoDrtI2EFtBSw7xUmwIPCuqj--JbxLcA0e-2NkQVeO8Fq4TV6GwJJV85J5xpnGdvPiVokcQ6x0yYkXc8blb0VOssiFOCCk7hC-rTji-m5nRYm1c1ZC5xJcZys0SU9pQeYbVhgFyIplir4gb634lzXFNyUiHqwKIGXD-SGb718GmNTHLTTyvVMuBruo8nYxV8I68AsDdnDM19QUBFfH0dnVmc63WMp6FE4p8~QlhvjcJmbfnsa1ENoQ5rrKJBh~2~Y3K3bS5ZrI2JRjekHB9GDiajY585RjKtrICkD-trg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/42006193/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/42006193/mini_magick20190218-16376-1nnd45h.png?1550502671"}],"downloadable_attachments_with_full_thumbnails":[{"id":42006193,"asset_id":19856118,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/42006193/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/42006193/OR_0330-libre.pdf?1454556636=\u0026response-content-disposition=attachment%3B+filename%3DTelecommunication_carrier_selection_unde.pdf\u0026Expires=1740096574\u0026Signature=Dcv7Rh8HGoumQ57n7OKv8V3QN4Ka23vXl87-58kytLATwHoDrtI2EFtBSw7xUmwIPCuqj--JbxLcA0e-2NkQVeO8Fq4TV6GwJJV85J5xpnGdvPiVokcQ6x0yYkXc8blb0VOssiFOCCk7hC-rTji-m5nRYm1c1ZC5xJcZys0SU9pQeYbVhgFyIplir4gb634lzXFNyUiHqwKIGXD-SGb718GmNTHLTTyvVMuBruo8nYxV8I68AsDdnDM19QUBFfH0dnVmc63WMp6FE4p8~QlhvjcJmbfnsa1ENoQ5rrKJBh~2~Y3K3bS5ZrI2JRjekHB9GDiajY585RjKtrICkD-trg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/42006193/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/42006193/mini_magick20190218-16376-1nnd45h.png?1550502671"}],"has_pdf":true,"has_fulltext":true,"page_count":18,"ordered_authors":[{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"},{"id":34313351,"first_name":"Frits","last_name":"Spieksma","domain_name":"kuleuven","page_name":"FritsSpieksma","display_name":"Frits Spieksma","profile_url":"https://kuleuven.academia.edu/FritsSpieksma","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":217280,"name":"Mobile phone","url":"https://www.academia.edu/Documents/in/Mobile_phone","nofollow":true},{"id":246900,"name":"Business Process","url":"https://www.academia.edu/Documents/in/Business_Process","nofollow":true},{"id":466041,"name":"Market Share","url":"https://www.academia.edu/Documents/in/Market_Share","nofollow":true}],"publication_year":2003,"publication_year_with_fallback":2003,"paper_rank":null,"all_time_views":138,"active_discussion":{}}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19856119 coauthored" data-work_id="19856119" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19856119/A_Note_on_a_Motion_Control_Problem_for_a_Placement_Machine">A Note on a Motion Control Problem for a Placement Machine</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Assembling printed circuit boards efficiently using automated placement machines is a challenging task. Here, we focus on a motion control problem for a specific type of placement machines. More specifically, the problem is to establish... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19856119" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Assembling printed circuit boards efficiently using automated placement machines is a challenging task. Here, we focus on a motion control problem for a specific type of placement machines. More specifically, the problem is to establish movement patterns for the robot arm, the feeder rack, and -when appropriate -the worktable, of a sequential, pick-and-place machine. In this note we show that a (popular) greedy strategy may not always yield an optimum solution. However, under the Tchebychev metric, as well as under the Manhattan metric, we can model the problem as a linear program, thereby establishing the existence of a polynomial time algorithm for this motion control problem. Finally, we give experimental evidence that computing optimal solutions to this motion control problem can yield significantly better solutions than those found by a greedy method.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19856119" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="b95a0f13ac48cdba682bf1715e426c9d" rel="nofollow" data-download="{"attachment_id":40882054,"asset_id":19856119,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/40882054/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40902920" href="https://independent.academia.edu/Spieksma">F. Spieksma</a><script data-card-contents-for-user="40902920" type="text/json">{"id":40902920,"first_name":"F.","last_name":"Spieksma","domain_name":"independent","page_name":"Spieksma","display_name":"F. Spieksma","profile_url":"https://independent.academia.edu/Spieksma","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-19856119">+1</span><div class="hidden js-additional-users-19856119"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-19856119'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-19856119').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_19856119 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19856119"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19856119, container: ".js-paper-rank-work_19856119", }); });</script></li><li class="js-percentile-work_19856119 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19856119; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19856119"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19856119 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19856119"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19856119; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19856119]").text(description); $(".js-view-count-work_19856119").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19856119").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19856119"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="2189" rel="nofollow" href="https://www.academia.edu/Documents/in/Computational_Complexity">Computational Complexity</a>, <script data-card-contents-for-ri="2189" type="text/json">{"id":2189,"name":"Computational Complexity","url":"https://www.academia.edu/Documents/in/Computational_Complexity","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="10583" rel="nofollow" href="https://www.academia.edu/Documents/in/Motion_control">Motion control</a>, <script data-card-contents-for-ri="10583" type="text/json">{"id":10583,"name":"Motion control","url":"https://www.academia.edu/Documents/in/Motion_control","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="89056" rel="nofollow" href="https://www.academia.edu/Documents/in/Printed_Circuit_Board">Printed Circuit Board</a>, <script data-card-contents-for-ri="89056" type="text/json">{"id":89056,"name":"Printed Circuit Board","url":"https://www.academia.edu/Documents/in/Printed_Circuit_Board","nofollow":true}</script><a class="InlineList-item-text" data-has-card-for-ri="250085" rel="nofollow" href="https://www.academia.edu/Documents/in/Robot_Arm">Robot Arm</a><script data-card-contents-for-ri="250085" type="text/json">{"id":250085,"name":"Robot Arm","url":"https://www.academia.edu/Documents/in/Robot_Arm","nofollow":true}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19856119]'), work: {"id":19856119,"title":"A Note on a Motion Control Problem for a Placement Machine","created_at":"2015-12-27T13:27:00.943-08:00","owner_id":40651073,"url":"https://www.academia.edu/19856119/A_Note_on_a_Motion_Control_Problem_for_a_Placement_Machine","slug":"A_Note_on_a_Motion_Control_Problem_for_a_Placement_Machine","dom_id":"work_19856119","summary":"Assembling printed circuit boards efficiently using automated placement machines is a challenging task. Here, we focus on a motion control problem for a specific type of placement machines. More specifically, the problem is to establish movement patterns for the robot arm, the feeder rack, and -when appropriate -the worktable, of a sequential, pick-and-place machine. In this note we show that a (popular) greedy strategy may not always yield an optimum solution. However, under the Tchebychev metric, as well as under the Manhattan metric, we can model the problem as a linear program, thereby establishing the existence of a polynomial time algorithm for this motion control problem. Finally, we give experimental evidence that computing optimal solutions to this motion control problem can yield significantly better solutions than those found by a greedy method.","publication":"SSRN Electronic Journal","publication_with_fallback":"SSRN Electronic Journal","downloadable_attachments":[{"id":40882054,"asset_id":19856119,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40882054/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40882054/KBI_0623-libre.pdf?1451251764=\u0026response-content-disposition=attachment%3B+filename%3DA_Note_on_a_Motion_Control_Problem_for_a.pdf\u0026Expires=1740154567\u0026Signature=ddNO3ks6m9itfhoW~xurhwtBpCRmIfiG9de3nQ5tXgGj7S3-6-olD1EMkXeJm8jV7iZUzH80fxouEz-1ki7aQh-MfTFBRulFzW7nHjryJTNwxt2ehwXS-Ikeqxbw-idZcFfzHrJFOWL9OMd~6RJ0RwnXLb904aWFYXqHf5hNJjJ30CP55HuyZ8xYGAWtUcgFkX81PBShhgDz9aRxc9mu4WN9WTOjwSnS4KslOx-TiR5iOw1hb6fv6kigMPruSuqPWICt4bncyLZCYfb9idHrmkOj3RJ3YbSbkgvY7Wz-LReF~NsevYao5TzT2QoCRTFizGQtO2q3VTuA9QZxfnYMcA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40882054/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40882054/mini_magick20220704-32457-1ecfo3.png?1656968972"}],"downloadable_attachments_with_full_thumbnails":[{"id":40882054,"asset_id":19856119,"asset_type":"Work","always_allow_download":false,"scribd_thumbnail_url":"https://attachments.academia-assets.com/40882054/thumbnails/1.jpg","download_url":"https://d1wqtxts1xzle7.cloudfront.net/40882054/KBI_0623-libre.pdf?1451251764=\u0026response-content-disposition=attachment%3B+filename%3DA_Note_on_a_Motion_Control_Problem_for_a.pdf\u0026Expires=1740154567\u0026Signature=ddNO3ks6m9itfhoW~xurhwtBpCRmIfiG9de3nQ5tXgGj7S3-6-olD1EMkXeJm8jV7iZUzH80fxouEz-1ki7aQh-MfTFBRulFzW7nHjryJTNwxt2ehwXS-Ikeqxbw-idZcFfzHrJFOWL9OMd~6RJ0RwnXLb904aWFYXqHf5hNJjJ30CP55HuyZ8xYGAWtUcgFkX81PBShhgDz9aRxc9mu4WN9WTOjwSnS4KslOx-TiR5iOw1hb6fv6kigMPruSuqPWICt4bncyLZCYfb9idHrmkOj3RJ3YbSbkgvY7Wz-LReF~NsevYao5TzT2QoCRTFizGQtO2q3VTuA9QZxfnYMcA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA","download_file_url":"https://www.academia.edu/attachments/40882054/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&","full_thumbnail_url":"https://0.academia-photos.com/attachment_thumbnails/40882054/mini_magick20220704-32457-1ecfo3.png?1656968972"}],"has_pdf":true,"has_fulltext":true,"page_count":15,"ordered_authors":[{"id":40902920,"first_name":"F.","last_name":"Spieksma","domain_name":"independent","page_name":"Spieksma","display_name":"F. Spieksma","profile_url":"https://independent.academia.edu/Spieksma","photo":"/images/s65_no_pic.png"},{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":2189,"name":"Computational Complexity","url":"https://www.academia.edu/Documents/in/Computational_Complexity","nofollow":true},{"id":10583,"name":"Motion control","url":"https://www.academia.edu/Documents/in/Motion_control","nofollow":true},{"id":89056,"name":"Printed Circuit Board","url":"https://www.academia.edu/Documents/in/Printed_Circuit_Board","nofollow":true},{"id":250085,"name":"Robot Arm","url":"https://www.academia.edu/Documents/in/Robot_Arm","nofollow":true},{"id":1451580,"name":"LINEAR PROGRAM","url":"https://www.academia.edu/Documents/in/LINEAR_PROGRAM"},{"id":1993320,"name":"Optimal Solution","url":"https://www.academia.edu/Documents/in/Optimal_Solution"},{"id":2047732,"name":"Movement pattern","url":"https://www.academia.edu/Documents/in/Movement_pattern"}],"publication_year":2000,"publication_year_with_fallback":2000,"paper_rank":null,"all_time_views":8,"active_discussion":{}}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19856120" data-work_id="19856120" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19856120/On_the_complexity_of_high_multiplicity_scheduling_problems">On the complexity of high multiplicity scheduling problems</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The purpose of this note is to propose a complexity framework for the analysis of high multiplicity scheduling problems. Part of this framework relies on earlier work aiming at the definition of outputsensitive complexity measures for the... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_19856120" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The purpose of this note is to propose a complexity framework for the analysis of high multiplicity scheduling problems. Part of this framework relies on earlier work aiming at the definition of outputsensitive complexity measures for the analysis of algorithms which produce "large" outputs. However, different classes emerge according as we look at schedules as sets of starting times, or as related single-valued mappings.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19856120" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="9d025c056af614d63d8a797032e50315" rel="nofollow" data-download="{"attachment_id":41282757,"asset_id":19856120,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/41282757/download_file?st=MTc0MDE1MDk2Nyw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40651073" href="https://eur.academia.edu/JorisvandeKlundert">Joris van de Klundert</a><script data-card-contents-for-user="40651073" type="text/json">{"id":40651073,"first_name":"Joris van de","last_name":"Klundert","domain_name":"eur","page_name":"JorisvandeKlundert","display_name":"Joris van de Klundert","profile_url":"https://eur.academia.edu/JorisvandeKlundert","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_19856120 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19856120"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19856120, container: ".js-paper-rank-work_19856120", }); });</script></li><li class="js-percentile-work_19856120 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19856120; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19856120"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19856120 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19856120"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19856120; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19856120]").text(description); $(".js-view-count-work_19856120").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19856120").removeClass('hidden') })</script></div></li></ul></li></ul></div></div></div></div><div class="u-taCenter Pagination"><ul class="pagination "> <li class="page active"> <a href="/Departments/Institutd_of_Health_Policy_and_Management/Documents">1</a> </li> <li class="page"> <a rel="next" href="/Departments/Institutd_of_Health_Policy_and_Management/Documents?page=2">2</a> </li> <li class="page"> <a href="/Departments/Institutd_of_Health_Policy_and_Management/Documents?page=3">3</a> </li> <li class="next_page"> <a rel="next" href="/Departments/Institutd_of_Health_Policy_and_Management/Documents?page=2">Next &rsaquo;</a> </li> <li class="last next"> <a href="/Departments/Institutd_of_Health_Policy_and_Management/Documents?page=3">Last »</a> </li> </ul> </div></div></div></div></div></div></div> </div> <div class="bootstrap login"><div class="modal fade login-modal" id="login-modal"><div class="login-modal-dialog modal-dialog"><div class="modal-content"><div class="modal-header"><button class="close close" data-dismiss="modal" type="button"><span aria-hidden="true">×</span><span class="sr-only">Close</span></button><h4 class="modal-title text-center"><strong>Log In</strong></h4></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><button class="btn btn-fb btn-lg btn-block btn-v-center-content" id="login-facebook-oauth-button"><svg style="float: left; width: 19px; line-height: 1em; margin-right: .3em;" aria-hidden="true" focusable="false" data-prefix="fab" data-icon="facebook-square" class="svg-inline--fa fa-facebook-square fa-w-14" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512"><path fill="currentColor" d="M400 32H48A48 48 0 0 0 0 80v352a48 48 0 0 0 48 48h137.25V327.69h-63V256h63v-54.64c0-62.15 37-96.48 93.67-96.48 27.14 0 55.52 4.84 55.52 4.84v61h-31.27c-30.81 0-40.42 19.12-40.42 38.73V256h68.78l-11 71.69h-57.78V480H400a48 48 0 0 0 48-48V80a48 48 0 0 0-48-48z"></path></svg><small><strong>Log in</strong> with <strong>Facebook</strong></small></button><br /><button class="btn btn-google btn-lg btn-block btn-v-center-content" id="login-google-oauth-button"><svg style="float: left; width: 22px; line-height: 1em; margin-right: .3em;" aria-hidden="true" focusable="false" data-prefix="fab" data-icon="google-plus" class="svg-inline--fa fa-google-plus fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M256,8C119.1,8,8,119.1,8,256S119.1,504,256,504,504,392.9,504,256,392.9,8,256,8ZM185.3,380a124,124,0,0,1,0-248c31.3,0,60.1,11,83,32.3l-33.6,32.6c-13.2-12.9-31.3-19.1-49.4-19.1-42.9,0-77.2,35.5-77.2,78.1S142.3,334,185.3,334c32.6,0,64.9-19.1,70.1-53.3H185.3V238.1H302.2a109.2,109.2,0,0,1,1.9,20.7c0,70.8-47.5,121.2-118.8,121.2ZM415.5,273.8v35.5H380V273.8H344.5V238.3H380V202.8h35.5v35.5h35.2v35.5Z"></path></svg><small><strong>Log in</strong> with <strong>Google</strong></small></button><br /><style type="text/css">.sign-in-with-apple-button { width: 100%; height: 52px; border-radius: 3px; border: 1px solid black; cursor: pointer; } .sign-in-with-apple-button > div { margin: 0 auto; / This centers the Apple-rendered button horizontally }</style><script src="https://appleid.cdn-apple.com/appleauth/static/jsapi/appleid/1/en_US/appleid.auth.js" type="text/javascript"></script><div class="sign-in-with-apple-button" data-border="false" data-color="white" id="appleid-signin"><span   ="Sign Up with Apple" class="u-fs11"></span></div><script>AppleID.auth.init({ clientId: 'edu.academia.applesignon', scope: 'name email', redirectURI: 'https://www.academia.edu/sessions', state: "5f19dda4faad3c3db64884bc5b48ec466b735e12be0d1fee5b7abb5fae5752e0", });</script><script>// Hacky way of checking if on fast loswp if (window.loswp == null) { (function() { const Google = window?.Aedu?.Auth?.OauthButton?.Login?.Google; const Facebook = window?.Aedu?.Auth?.OauthButton?.Login?.Facebook; if (Google) { new Google({ el: '#login-google-oauth-button', rememberMeCheckboxId: 'remember_me', track: null }); } if (Facebook) { new Facebook({ el: '#login-facebook-oauth-button', rememberMeCheckboxId: 'remember_me', track: null }); } })(); }</script></div></div></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><div class="hr-heading login-hr-heading"><span class="hr-heading-text">or</span></div></div></div></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><form class="js-login-form" action="https://www.academia.edu/sessions" accept-charset="UTF-8" method="post"><input type="hidden" name="authenticity_token" value="yXLa4uXyrosSJg6oSzehqxOcHsFBGmcHSWKvA4IyuGTMXbTFntfIKwRZYK6eENjgNk5HkRosc77a967VU9UQZA" autocomplete="off" /><div class="form-group"><label class="control-label" for="login-modal-email-input" style="font-size: 14px;">Email</label><input class="form-control" id="login-modal-email-input" name="login" type="email" /></div><div class="form-group"><label class="control-label" for="login-modal-password-input" style="font-size: 14px;">Password</label><input class="form-control" id="login-modal-password-input" name="password" type="password" /></div><input type="hidden" name="post_login_redirect_url" id="post_login_redirect_url" value="https://eur.academia.edu/Departments/Institutd_of_Health_Policy_and_Management/Documents" autocomplete="off" /><div class="checkbox"><label><input type="checkbox" name="remember_me" id="remember_me" value="1" checked="checked" /><small style="font-size: 12px; margin-top: 2px; display: inline-block;">Remember me on this computer</small></label></div><br><input type="submit" name="commit" value="Log In" class="btn btn-primary btn-block btn-lg js-login-submit" data-disable-with="Log In" /></br></form><script>typeof window?.Aedu?.recaptchaManagedForm === 'function' && window.Aedu.recaptchaManagedForm( document.querySelector('.js-login-form'), document.querySelector('.js-login-submit') );</script><small style="font-size: 12px;"><br />or <a data-target="#login-modal-reset-password-container" data-toggle="collapse" href="javascript:void(0)">reset password</a></small><div class="collapse" id="login-modal-reset-password-container"><br /><div class="well margin-0x"><form class="js-password-reset-form" action="https://www.academia.edu/reset_password" accept-charset="UTF-8" method="post"><input type="hidden" name="authenticity_token" value="o1DXFusSJOS3JM02B16zUeTjuI7kuJihtnKS8BYGf0Smf7kxkDdCRKFbozDSecoawTHh3r-OjBgl55Mmx-HXRA" autocomplete="off" /><p>Enter the email address you signed up with and we'll email you a reset link.</p><div class="form-group"><input class="form-control" name="email" type="email" /></div><script src="https://recaptcha.net/recaptcha/api.js" async defer></script> <script> var invisibleRecaptchaSubmit = function () { var closestForm = function (ele) { var curEle = ele.parentNode; while (curEle.nodeName !== 'FORM' && curEle.nodeName !== 'BODY'){ curEle = curEle.parentNode; } return curEle.nodeName === 'FORM' ? curEle : null }; var eles = document.getElementsByClassName('g-recaptcha'); if (eles.length > 0) { var form = closestForm(eles[0]); if (form) { form.submit(); } } }; </script> <input type="submit" data-sitekey="6Lf3KHUUAAAAACggoMpmGJdQDtiyrjVlvGJ6BbAj" data-callback="invisibleRecaptchaSubmit" class="g-recaptcha btn btn-primary btn-block" value="Email me a link" value=""/> </form></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/collapse-45805421cf446ca5adf7aaa1935b08a3a8d1d9a6cc5d91a62a2a3a00b20b3e6a.js"], function() { // from javascript_helper.rb $("#login-modal-reset-password-container").on("shown.bs.collapse", function() { $(this).find("input[type=email]").focus(); }); }); </script> </div></div></div><div class="modal-footer"><div class="text-center"><small style="font-size: 12px;">Need an account? <a rel="nofollow" href="https://www.academia.edu/signup">Click here to sign up</a></small></div></div></div></div></div></div><script>// If we are on subdomain or non-bootstrapped page, redirect to login page instead of showing modal (function(){ if (typeof $ === 'undefined') return; var host = window.location.hostname; if ((host === $domain || host === "www."+$domain) && (typeof $().modal === 'function')) { $("#nav_log_in").click(function(e) { // Don't follow the link and open the modal e.preventDefault(); $("#login-modal").on('shown.bs.modal', function() { $(this).find("#login-modal-email-input").focus() }).modal('show'); }); } })()</script> <div class="bootstrap" id="footer"><div class="footer-content clearfix text-center padding-top-7x" style=""><ul class="footer-links-secondary footer-links-wide list-inline margin-bottom-1x"><li><a href="https://www.academia.edu/about">About</a></li><li><a href="https://www.academia.edu/press">Press</a></li><li><a href="https://www.academia.edu/documents">Papers</a></li><li><a href="https://www.academia.edu/topics">Topics</a></li><li><a href="https://www.academia.edu/journals">Academia.edu Journals</a></li><li><a rel="nofollow" href="https://www.academia.edu/hiring"><svg style="width: 13px; height: 13px;" aria-hidden="true" focusable="false" data-prefix="fas" data-icon="briefcase" class="svg-inline--fa fa-briefcase fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M320 336c0 8.84-7.16 16-16 16h-96c-8.84 0-16-7.16-16-16v-48H0v144c0 25.6 22.4 48 48 48h416c25.6 0 48-22.4 48-48V288H320v48zm144-208h-80V80c0-25.6-22.4-48-48-48H176c-25.6 0-48 22.4-48 48v48H48c-25.6 0-48 22.4-48 48v80h512v-80c0-25.6-22.4-48-48-48zm-144 0H192V96h128v32z"></path></svg> <strong>We're Hiring!</strong></a></li><li><a rel="nofollow" href="https://support.academia.edu/hc/en-us"><svg style="width: 12px; height: 12px;" aria-hidden="true" focusable="false" data-prefix="fas" data-icon="question-circle" class="svg-inline--fa fa-question-circle fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M504 256c0 136.997-111.043 248-248 248S8 392.997 8 256C8 119.083 119.043 8 256 8s248 111.083 248 248zM262.655 90c-54.497 0-89.255 22.957-116.549 63.758-3.536 5.286-2.353 12.415 2.715 16.258l34.699 26.31c5.205 3.947 12.621 3.008 16.665-2.122 17.864-22.658 30.113-35.797 57.303-35.797 20.429 0 45.698 13.148 45.698 32.958 0 14.976-12.363 22.667-32.534 33.976C247.128 238.528 216 254.941 216 296v4c0 6.627 5.373 12 12 12h56c6.627 0 12-5.373 12-12v-1.333c0-28.462 83.186-29.647 83.186-106.667 0-58.002-60.165-102-116.531-102zM256 338c-25.365 0-46 20.635-46 46 0 25.364 20.635 46 46 46s46-20.636 46-46c0-25.365-20.635-46-46-46z"></path></svg> <strong>Help Center</strong></a></li></ul><ul class="footer-links-tertiary list-inline margin-bottom-1x"><li class="small">Find new research papers in:</li><li class="small"><a href="https://www.academia.edu/Documents/in/Physics">Physics</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Chemistry">Chemistry</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Biology">Biology</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Health_Sciences">Health Sciences</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Ecology">Ecology</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Earth_Sciences">Earth Sciences</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Cognitive_Science">Cognitive Science</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Mathematics">Mathematics</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a></li></ul></div></div><div class="DesignSystem" id="credit" style=""><ul class="u-pl0x footer-links-legal list-inline"><li><a rel="nofollow" href="https://www.academia.edu/terms">Terms</a></li><li><a rel="nofollow" href="https://www.academia.edu/privacy">Privacy</a></li><li><a rel="nofollow" href="https://www.academia.edu/copyright">Copyright</a></li><li>Academia ©2025</li></ul></div><script> //<![CDATA[ window.detect_gmtoffset = true; window.Academia && window.Academia.set_gmtoffset && Academia.set_gmtoffset('/gmtoffset'); //]]> </script> <div id='overlay_background'></div> <div id='bootstrap-modal-container' class='bootstrap'></div> <div id='ds-modal-container' class='bootstrap DesignSystem'></div> <div id='full-screen-modal'></div> </div> </body> </html>