The Two-stage Assembly Flow Shop Scheduling with an Availability Constraint: Worst Case Analysis

Autor:	Hatem Hadda, Sonia Hajri-Gabouj, Najoua Dridi
Rok vydání:	2013
Předmět:	Constraint (information theory) Mathematical optimization Job shop scheduling Computer science Applied Mathematics Modeling and Simulation Scheduling (production processes) Minification Flow shop scheduling Limited availability Heuristics Case analysis
Zdroj:	Journal of Mathematical Modelling and Algorithms in Operations Research. 13:233-245
ISSN:	2214-2495 2214-2487
DOI:	10.1007/s10852-013-9235-7
Popis:	In this paper, we are interested in handling the limited availability of machines in the two-stage assembly flow shop scheduling problems. Emphasis is put on the semiresumable case with respect to the minimization of the makespan. We provide, when possible, heuristics with a tight worst-case ratio bound of 2.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::507ef25b06ff45949c2562cf8a391d99 https://doi.org/10.1007/s10852-013-9235-7 Zobrazit plný text záznamu Full text from SpringerLink