نتایج جستجو برای: sequencing and scheduling
تعداد نتایج: 16856732 فیلتر نتایج به سال:
This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the makespan for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly ge...
This paper is concerned with scheduling robotic flexible assembly cells (RFACs) using fuzzy logic (FL) technique. A new scheduling rule is developed and evaluated called fuzzy sequencing rule (FSR). A simulation program is used to examine the performance of the existing scheduling rules and the proposed rule with respect to multiple performance measures. Four performance measures considered sim...
Designing a scheduling competition to attract researchers from the several fields interested in scheduling problems seems a challenging, and highly worthwhile effort. In this paper, we propose a design for one possible track of this proposed scheduling competition. Specifically, we propose a track aimed at one machine sequencing problems. We argue that any such track must include problems with ...
In scheduling the transmission of messages in a WDM network, we are facing not only the channel assignment problem but also message sequencing problem In this paper, we propose and evaluate a new reservationbased message scheduling algorithm for single-hop, WDM passive star lightwave network which addresses both the assignment aspect and the sequencing aspect of the problem. We compare the perf...
Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...
Several production environments require simultaneous planing of sizing and scheduling of sequences of production lots. Integration of sequencing decisions in lotsizing and scheduling problems has received an increased attention from the research community due to its inherent applicability to real world problems. A two-dimensional classification framework is proposed to survey and classify the m...
We study a scheduling problem that belongs to the yard operations component of the railroad planning problems, namely the hump sequencing problem. The scheduling problem is characterized as a single-machine problem with stepwise tardiness cost objectives. This is a new scheduling criterion which is also relevant in the context of traditional machine scheduling problems. We produce complexity re...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید