Zobrazeno 1 - 10
of 338
pro vyhledávání: '"Gupta, SM"'
The disassembly line balancing (DLB) problem assigns the set of tasks to each workstation for each product to be disassembled and aims at attaining several objectives, such as minimising the number of workstations, ensuring similar idle time at each
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::25d7e6a2213e97ddc3191558947b44b4
For remanufacturing or recycling companies, a reverse supply chain is of prime importance since it facilitates in recovering parts and materials from end-of-life products. In reverse supply chains, selective separation of desired parts and materials
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3566::49c9a6b94062368cbf58187f636611c3
http://acikerisim.pau.edu.tr:8080/xmlui/handle/11499/23082
http://acikerisim.pau.edu.tr:8080/xmlui/handle/11499/23082
The assembly line worker assignment and balancing problem type-II (ALWABP-2) occurs when workers and tasks (where task times depend on workers' skills) are to be simultaneously assigned to a fixed number of workstations with the goal of minimising th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3566::5f2cf748ed535638f55edacb94f56d81
http://acikerisim.pau.edu.tr:8080/xmlui/handle/11499/23306
http://acikerisim.pau.edu.tr:8080/xmlui/handle/11499/23306
This paper presents a fuzzy extension of the disassembly line balancing problem (DLBP) with fuzzy task processing times since uncertainty is the main character of real-world disassembly systems. The processing times of tasks are formulated by triangu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::913b2aa52391a3f7290562c16d999ef0
http://acikerisim.pau.edu.tr:8080/xmlui/handle/11499/22284
http://acikerisim.pau.edu.tr:8080/xmlui/handle/11499/22284
Autor:
Kalayci, CB, Gupta, SM
In this paper, we consider a sequence-dependent disassembly line balancing problem (SDDLBP) with multiple objectives that requires the assignment of disassembly tasks to a set of ordered disassembly workstations while satisfying the disassembly prece
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3566::0be9d557fafbfcc1b463b44d06d87ad8
http://acikerisim.pau.edu.tr:8080/xmlui/handle/11499/22011
http://acikerisim.pau.edu.tr:8080/xmlui/handle/11499/22011
Autor:
Kalayci, CB, Gupta, SM
In this paper, we consider a sequence-dependent disassembly line balancing problem (SDDLBP) with multiple objectives that requires the assignment of disassembly tasks to a set of ordered disassembly workstations while satisfying the disassembly prece
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6da02f6b2cce6d0259a7b3717c8e9bd1
http://acikerisim.pau.edu.tr:8080/xmlui/handle/11499/21161
http://acikerisim.pau.edu.tr:8080/xmlui/handle/11499/21161
In this paper, we discuss the disassembly line balancing problem in the presence of task failures (DLBP-F). There are precedence relationships among disassembly tasks and the tasks must be completed within a given time, determined by the demand in a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3566::841a770a61d8caff0c216d3f0e0f0231
http://acikerisim.pau.edu.tr:8080/xmlui/handle/11499/17277
http://acikerisim.pau.edu.tr:8080/xmlui/handle/11499/17277
We present a Petri net (PN)-based approach to automatically generate disassembly process plans (DPPs) for product recycling or remanufacturing. We define an algorithm to generate a geometrically-based disassembly precedence matrix (DPM) from a CAD dr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3a1307459466ccbd724c655bfdbc4577
http://acikerisim.pau.edu.tr:8080/xmlui/handle/11499/25481
http://acikerisim.pau.edu.tr:8080/xmlui/handle/11499/25481
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.