Minmax due-date assignment on a two-machine flowshop

Autor:	Baruch Mor, Gur Mosheiov
Rok vydání:	2021
Předmět:	Focus (computing) Mathematical optimization Due date Computer science Theory of computation General Decision Sciences Function (mathematics) Management Science and Operations Research Minimax Time complexity Scheduling (computing)
Zdroj:	Annals of Operations Research. 305:191-209
ISSN:	1572-9338 0254-5330
DOI:	10.1007/s10479-021-04212-y
Popis:	We extend two classical scheduling and due-date assignment models. In the first (known in the literature as DIF), due-dates are determined by penalties for exceeding pre-specified deadlines. In the second (known as SLK), due-dates are assigned to jobs as a (linear) function of their processing times. We focus on the minmax versions of these models, and extend the single machine versions to a two-machine flowshop. We further extend the settings to that of a due-window. All the problems studied in this note are shown to have polynomial time solutions.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::1fd3b3a5821dbf170f8ebaa97b9b2f85 https://doi.org/10.1007/s10479-021-04212-y Zobrazit plný text záznamu Plný text ve formátu PDF Plný text ve formátu HTML
Nepřihlášeným uživatelům se plný text nezobrazuje	K zobrazení výsledku je třeba se přihlásit.