نتایج جستجو برای: family setup times

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

Journal: :International Journal of Production Management and Engineering 2017

2005
Satyandra K. Gupta Deepak Rajagopal

Sheet metal bending press-brakes can be setup to produce more than one type of part without requiring a setup change. To exploit this flexibility, we need setup planning techniques so that press-brake setups can be shared among many different parts. In this paper, we describe algorithms for partitioning a given set of parts into setup compatible part families that can be produced on the same se...

This paper  presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...

This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...

2014
Yong He Li Sun Gradimir Milovanovic

We consider two single-machine group scheduling problems with deteriorating group setup and job processing times. That is, the job processing times and group setup times are linearly increasing or decreasing functions of their starting times. Jobs in each group have the same deteriorating rate. The objective of scheduling problems is to minimize the sum of completion times. We show that the sum...

Journal: :journal of optimization in industrial engineering 2010
bahman naderi mostafa zandieh seyed mohammad taghi fatemi ghomi

this paper explores the flexile flow lines where setup times are sequence- dependent. the optimization criterion is the minimization of total weighted completion time. we propose an iterated greedy algorithm (iga) to tackle the problem. an experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of iga are compared against those of some other exist...

This investigation deals with MX/G/1 queueing model with setup, bulk- arrival, loss-delay and balking. The provision of second optional service apart from essential service by an unreliable server is taken into consideration. We assume that the delay customers join the queue when server is busy whereas loss customers depart from the system. After receiving the essential service, the customers m...

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

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