One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective

Autor:	Mohammed Fazle Baki, Raymond G. Vickson
Rok vydání:	2004
Předmět:	Dynamic programming Mathematical optimization Control and Optimization Computational complexity theory Job shop scheduling Computer science Applied Mathematics Flow shop scheduling Open shop Pseudo-polynomial time Software Scheduling (computing)
Zdroj:	Optimization Methods and Software. 19:165-178
ISSN:	1029-4937 1055-6788
Popis:	One-operator two-machine open shop and flow shop problems are 𝒩𝒫-hard in the ordinary sense even if all the weights are the same. We discuss two different pseudo polynomial dynamic programming recursions for each of the open shop and flow shop case. Some of the running times are better than those of the best known algorithms in the literature. †E-mail: rvickson@engmail.uwaterloo.ca
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::a7c9b12f42a422c742b2fab2302a876d https://doi.org/10.1080/10556780410001657653 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.