This paper considers sequencing situations with due date criteria. Three di erent types of criteria are considered: the weighted penalty criterion, the weighted tardiness criterion and the completion time criterion. The main focus is on convexity of the associated cooperative games.

In this paper we consider the single machine scheduling problem with integer release dates and the objective of minimising the sum of deviations of jobs’ completion times from a common integer due date. We present an efficient polynomial algorithm for the unit processing time case. We also show how to calculate in polynomial time the minimum non-restrictive due date for the general case.

iran has not yet gained the desired place in world date market, due to not considering the world standards in the processes of grading and packaging. machine vision and image processing are two of the new techniques that have found their places of application in agricultural industry. in this research, a solution has been introduced for classification of mozafati date introducing 5 different gr...

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

We study the scheduling situation where n tasks, subjected to release dates and due dates, have to be scheduled on m parallel processors. We show that, when tasks have unit processing times and either require 1 or m processors simultaneously, the minimum maximal tardiness can be computed in polynomial time. The complexity status of this “tall/small” task scheduling problem P|ri, pi = 1, sizei ∈...

In this paper, we propose 260 scheduling problems whose size is greater than that of the rare examples published. Such sizes correspond to real dimensions of industrial problems. The types of problems that we propose are : the permutation flow shop, the job shop and the open shop scheduling problems. We restrict us to basic problems : the processing times are fixed, there are neither set-up tim...

This paper deals with constrained multistage machines flow-shop (FS) scheduling model in which processing times, job weights, and break-down machine time are characterized by fuzzy numbers that piecewise as well quadratic nature. Avoiding to convert the into its crisp, closed interval approximation for is incorporated. The suggested method leads a noncrossing optimal sequence considered problem...