نتایج جستجو برای: dependent setup time

تعداد نتایج: 2463608  

2014
Chuan-Li Zhao Chou-Jung Hsu Hua-Feng Hsu

This paper considers single machine scheduling and due date assignment with setup time. The setup time is proportional to the length of the already processed jobs; that is, the setup time is past-sequence-dependent (p-s-d). It is assumed that a job's processing time depends on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs, and the...

Journal: :Int. J. Comput. Geometry Appl. 2006
Moshe Dror Yusin Lee James B. Orlin Valentin Polishchuk

This paper introduces a new notion related to the traveling salesperson problem (TSP) — the notion of the TSP ratio. The TSP ratio of a TSP instance I is the sum of the marginal values of the nodes of I divided by the length of the optimal TSP tour on I, where the marginal value of a node i ∈ I is the difference between the length of the optimal tour on I and the length of the optimal tour on I...

Journal: :Complex & Intelligent Systems 2022

Abstract This paper addresses a multi-objective energy-efficient scheduling problem of the distributed permutation flowshop with sequence-dependent setup time and no-wait constraints (EEDNWFSP), which have important practical applications. Two objectives minimization both makespan total energy consumption (TEC) are considered simultaneously. To address this problem, new mixed-integer linear pro...

This paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completion time of the last job on the last machine (makespan) while processing parts (jobs) in each family together. Gaining an optimal s...

Journal: :international journal of industrial engineering and productional research- 0
morteza rasti-barzoki isfahan university of technology, isfahan, 84156-83111, iran ali kourank beheshti isfahan university of technology, isfahan, 84156-83111, iran seyed reza hejazi isfahan university of technology, isfahan, 84156-83111, iran

this paper addresses a production and outbound distribution scheduling problem in which a set of jobs have to be process on a single machine for delivery to customers or to other machines for further processing. we assume that there is a sufficient number of vehicles and the delivery costs is independent of batch size but it is dependent on each trip. in this paper, we present an artificial imm...

Journal: :amirkabir international journal of electrical & electronics engineering 2014
v. pourahmadi s. valaee

rapid expansions of new location-based services signify the need for finding accurate localization techniques for indoor environments. among different techniques, rss-based  schemes and in particular oneof its variants which is based on graph-based semi-supervised learning (g-ssl) are widely-used approaches the superiority of this scheme is that it has low setup/training cost and at the same ti...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید