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

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

2008
Eugene Levner Vladimir Kats David Alcaide

There is a growing interest on cyclic scheduling problems both in the scheduling literature and among practitioners in the industrial world. There are numerous examples of applications of cyclic scheduling problems in different industries (see, e.g., Hall (1999), Pinedo (2001)), automatic control (Romanovskii (1967), Cohen et al. (1985)), multi-processor computations (Hanen and Munier (1995), K...

This paper presents a new mathematical programming model for an integrated production and air transportation in supply chain management with sequence-dependent setup times in order to design an applied procedure for the production and distribution schedule. The aim of this model is to minimize the total supply chain cost consisting of the costs of distribution, production earliness and tardines...

This paper presents a new mathematical programming model for an integrated production and air transportation in supply chain management with sequence-dependent setup times in order to design an applied procedure for the production and distribution schedule. The aim of this model is to minimize the total supply chain cost consisting of the costs of distribution, production earliness and tardines...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شیراز - دانشکده علوم پایه 1392

a novel and ultra low cost isfet electrode and measurement system was designed for isfet application and detection of hydronium, hydrazinium and potassium ions. also, a measuring setup containing appropriate circuits, suitable analyzer (advantech board), de noise reduction elements, cooling system and pc was used for controlling the isfet electrode and various characteristic measurements. the t...

2009
Laurent Gourvès Jérôme Monnot Orestis Telelis

We study multiprocessor scheduling games with setup times on identical machines. Given a set of scheduling policies (coordination mechanism) on the machines, each out of n players chooses a machine to assign his owned job to, so as to minimize his individual completion time. Each job has a processing length and is of a certain type. Same-type jobs incur a setup overhead to the machine they are ...

This paper considers the economic lot and delivery scheduling problem in a two-echelon supply chains, where a single supplier produces multiple components on a flexible flow line (FFL) and delivers them directly to an assembly facility (AF). The objective is to determine a cyclic schedule that minimizes the sum of transportation, setup and inventory holding costs per unit time without shortage....

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور - دانشگاه پیام نور استان تهران - دانشکده علوم ریاضی و مهندسی کامپیوتر 1392

heuristics are often used to provide solutions for flow shop scheduling problems.the performance of a heuristic is usually judged by comparing solutions and run times on test cases.this investigation proposes an analytical alternative ,called asymptotic convergence ,which tests the convergence of the heuristic to a lower bound as problem size grows. the test is a stronger variation of worst cas...

Journal: :European Journal of Operational Research 2021

Abstract Single-machine scheduling where jobs have a penalty for being late or rejected altogether is an important (sub)problem in manufacturing, logistics, and satellite scheduling. It known to be NP-hard the strong sense, there no polynomial-time algorithm that can guarantee constant-factor approximation (unless P=NP). We provide exact fixed-parameter tractable slack maximum number of time wi...

The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...

Journal: :international journal of industrial engineering and productional research- 0
mir saber salehi mir babol javad rezaeian babol

this paper considers identical parallel machines scheduling problem with past-sequence-dependent setup times, deteriorating jobs and learning effects, in which the actual processing time of a job on each machine is given as a function of the processing times of the jobs already processed and its scheduled position on the corresponding machine. in addition, the setup time of a job on each machin...

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

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