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

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

Journal: :مهندسی صنایع 0
ایمان بساق زاده دانشگاه صنعتی اصفهان سید رضا حجازی دانشگاه صنعتی اصفهان امیر موسی احسان دانشگاه صنعتی شریف

the research on project scheduling has widely expanded over the last few decades. the vast majority of these research efforts focus on exact and suboptimal procedures for constructing a workable schedule, assuming complete information and a static deterministic problem environment. project activities are scheduled subject to both technological precedence constraints and resource constraints, mo...

Scheduling is an important subject of production and operations management area. In flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. The concept of transportation time is very important in scheduling. Transportation can be done by robots. In situations that robots are used to transpor...

Nirmala P.Ratchagar S. Kavitha

This paper presents a simplifiedlagrangian multiplier based algorithm to solve the fixed head hydrothermalscheduling problem. In fixed head hydrothermal scheduling problem, waterdischarge rate is modeled as quadratic function of hydropower generation andfuel cost is modeled as quadratic function of thermal power generation. Thepower output of each hydro unit varies with the rate of water discha...

Abdollahi, A. , Mollahassani-pour, M. , Nikbakhsh, S. , Rashidinejad, M. ,

Preventive maintenance scheduling of generating units is addressed as a long-term scheduling in power system studies aiming to increase the reliability incorporating cost reduction. It consists of knowing which generating units should be shut down for regular safety inspection. In this paper, a new formulation of preventive maintenance scheduling associated with cost reduction index (CRI) is pr...

In some industries as foundries, it is not technically feasible to interrupt a processor between jobs. This restriction gives rise to a scheduling problem called no-idle scheduling. This paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. The problem is first mathematically formulated by three different mixed integer linear programming...

G. Moslehi and M. Mahnam,

While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...

Nowadays, flexible manufacturing system (FMS) is introduced as a response to the competitive environment. Scheduling of FMS is more complex and more difficult than the other scheduling production systems. One of the main factors in scheduling of FMS is variable time of taking orders from customers, which leads to a sudden change in the manufacturing process. Also, some problems are created in p...

Simultaneous production planning and scheduling has been identified as one of the most important factors that affect the efficient implementation of planning and scheduling operations for the production systems. In this paper, simultaneous production planning and scheduling is applied in a hybrid flow shop environment, which has numerous applications in real industrial settings. In this problem...

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...

Journal: :journal of optimization in industrial engineering 2014
mohammad saidi mehrabad saeed zarghami

this paper presented a mixed integer programming for integrated scheduling and process planning. the presented process plan included some orders with precedence relations similar to multiple traveling salesman problem (mtsp), which was categorized as an np-hard problem. these types of problems are also called advanced planning because of simultaneously determining the appropriate sequence and m...

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

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