نتایج جستجو برای: machine scheduling

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

Journal: :journal of optimization in industrial engineering 2014
mohammad asghari samaneh nezhadali

appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. one type of scheduling problems is just-in-time (jit) scheduling and in this area, motivated by jit manufacturing, this study investigates a mathematical model for...

Mahsa Ghandehari Mohammad Modarres

In this paper, we first introduce a generalized version of open shop scheduling (OSS), called generalized cyclic open shop scheduling (GCOSS) and then develop a hybrid method of metaheuristic to solve this problem. Open shop scheduling is concerned with processing n jobs on m machines, where each job has exactly m operations and operation i of each job has to be processed on machine i . However...

Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...

Mehdy Morady Gohareh Naser Shams Gharneh Reza Ghasemy Yaghin

The objective in traditional scheduling is usually time based. Minimizing the makespan, total flow times, total tardi costs, etc. are instances of these objectives. In manufacturing, processing each job entails a cost paying and price receiving. Thus, the objective should include some notion of managing the flow of cash. We have defined two new objectives: maximization of average and minimum av...

Journal: :Computer and Information Science 2017
Guohua Zhang Xiang Li Yang Yang Minghuang Chen

Through the needs of Loading-Machine storage scheduling in forestry-pulp-paper production logistics intelligent distribution system, analysis the Loading-Machine scheduling model of problems and improvement measures, put forward Loading-Machine intelligent production scheduling algorithm, based on ensuring the feasibility of scheduling, scheduling to rationalization, equalization, execute only,...

Journal: :journal of optimization in industrial engineering 2010
jafar razmi reza tavakoli moghaddam mohammad saffari

this paper presents a mathematical model for a flow shop scheduling problem consisting of m machine and n jobs with fuzzy processing times that can be estimated as independent stochastic or fuzzy numbers. in the traditional flow shop scheduling problem, the typical objective is to minimize the makespan). however,, two significant criteria for each schedule in stochastic models are: expectable m...

Journal: :Theoretical Computer Science 2014

Journal: :journal of industrial engineering, international 2006
rasoul haji alireza haji

this paper deals with the single machine multi-product lot scheduling problem in which defective items are produced in any production run of each product. we have adopted the common cycle scheduling policy and assumed that the setup times for production of each product can be non-zero. further, we have assumed that defective items will be reworked and the inspection costs during the normal prod...

Hamid Reza Dehnar Saidy Mohammad Taghi Taghavi-Fard

In real world scheduling applications, machines might not be available during certain time periods due to deterministic or stochastic causes. In this article, the machine scheduling with availability constraints for both deterministic and stochastic cases with different environments, constraints and performance measures will be discussed. The existing body of research work in the literature wil...

  This investigation considers a reentrant permutation flowshop scheduling problem whose performance criterion is maximum tardiness. The reentrant flowshop (RFS) is a natural extension of the classical flowshop by allowing a job to visit certain machines more than once. The RFS scheduling problem, in which the job order is the same for each machine in each layer, is called a reentrant permutati...

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

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