نتایج جستجو برای: intermediate due dates

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

2009
Alok Singh Marc Sevaux André Rossi

This paper describes a hybrid grouping genetic algorithm for a multiprocessor scheduling problem, where a list of tasks has to be scheduled on identical parallel processors. Each task in the list is defined by a release date, a due date and a processing time. The objective is to minimize the number of processors used while respecting the constraints imposed by release dates and due dates. We ha...

2005
Xueyan Song Sanja Petrovic

In this paper, we present an approach to deal with fuzzy constraints in a flow shop problem. The flexible constraints on job release date and due date, as well as job processing time are described by fuzzy sets. We propose a method to calculate the satisfaction degree of the schedule with respect to fuzzy release dates and fuzzy due dates of jobs. The objective is to obtain a schedule which has...

2009
T eruo Masuda Toshio Nishida Hiroaki Ishii

In this paper, we analyze approximation algorithms for two types of scheduling problems. The first is the n jobs scheduling problem with due dates on m identical machines to minimize the maximum lateness. For this problem n/m/I/Lmax, we propose two approximation algorithms and derive their worst case bounds. The second is the 2 x n flow shop scheduling problem with due dates to minimize the max...

2002
Fred A. Johnson Andrew Royle

The U.S. Fish and Wildlife Service (USFWS) regulates the earliest opening and latest closing dates that States may use to establish duck-hunting seasons. These “framework dates” traditionally have centered around October 1 and January 20. The possibility of extending these dates so that seasons could open earlier and remain open later has been the subject of extensive and contentious debate wit...

2008
Malgorzata Sterna Jacek Blazewicz Erwin Pesch

The work concerns a genetic algorithm for the flow shop scheduling problem with release times and the late work criterion, which is NP-hard. The proposed meta-heuristic method minimizes the number of units of job processing times executed after their given due dates. We describe the components of this approach and present the analysis of test results. Computational experiments, preceded by an e...

Progressive collapse is a chain reaction of failures propagating throughout a portion of the structure disproportionate to the original local failure occurring when a sudden loss of a critical load‐bearing element initiates a structural element failure, eventually resulting in partial or full collapse of the structure. Both General Services Administration (GSA) and United States Department of D...

2012
Vikas S. Jadhav V. H. Bajaj

In this paper, we propose n-jobs to be processed on Single Machine Scheduling Problem (SMSP) involving fuzzy processing time and fuzzy due dates. The different due dates for each job be considered which meet the demand of customer with more satisfaction level. The main objective of this paper is the total penalty cost to be minimum in the schedule of the jobs on the single machine. This cost is...

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

abstract present research considered to examine and compare shahrray 14 years girls and boys narrative concerning with their responsibilities in this research, statistical society are 14 years girls and boys of shahrry . for performing this research. first, 14 years of 50 boys and 50 girls were selected in accidental method and have filled memati hormaled adolescents responsibility questioner...

Journal: :European Journal of Operational Research 2018
Sergey Polyakovskiy Rym M'Hallah

The two-dimensional non-oriented bin packing problem with due dates packs a set of rectangular items, which may be rotated by 90 degrees, into identical rectangular bins. The bins have equal processing times. An item’s lateness is the difference between its due date and the completion time of its bin. The problem packs all items without overlap as to minimize maximum lateness Lmax. The paper pr...

Journal: :European Journal of Operational Research 2003
Stefan Chanas Adam Kasperski

Two single machine scheduling problems with fuzzy processing times and fuzzy due dates are considered. In both we define the fuzzy tardiness of a job in a given sequence as a fuzzy maximum of zero and the difference between the fuzzy completion time and the fuzzy due date of this job. In the first problem we minimize the maximal expected value of a fuzzy tardiness and in the second we minimize ...

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

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