Displaying similar documents to “Scheduling under the Due Date Criterion with Varying Penalties for Lateness”

Multicriteria scheduling problems : a survey

V. T'kindt, J.-C. Billaut (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

This paper presents a state-of-the-art survey on multicriteria scheduling and introduces a definition of a multicriteria scheduling problem. It provides a framework that allows to tackle multicriteria scheduling problems, according to Decision Aid concepts. This problem is decomposed into three different problems. The first problem is about obtaining a model. The second one is how to take criteria into account and the third one is about solving a scheduling problem. An extension to an...

Scheduling problems with a common due window assignment: A survey

Adam Janiak, Tomasz Kwiatkowski, Maciej Lichtenstein (2013)

International Journal of Applied Mathematics and Computer Science

Similarity:

In this article a survey of studies on scheduling problems with a common due window assignment and earliness/tardiness penalty functions is presented. A due window is a generalization of the classical due date and describes a time interval in which a job should be finished. If a job is completed before or after the due window, it incurs an earliness or a tardiness penalty, respectively. In this survey we separately analyse the classical models with job-independent and job-dependent earliness/tardiness...

Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals

Valery S. Gordon, F. Werner, O. A. Yanushkevich (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

This paper is devoted to the following version of the single machine preemptive scheduling problem of minimizing the weighted number of late jobs. A processing time, a release date, a due date and a weight of each job are given. Certain jobs are specified to be completed in time, i.e., their due dates are assigned to be deadlines, while the other jobs are allowed to be completed after their due dates. The release/due date intervals are nested, i.e., no two of them overlap (either they...

Hybrid flow-shop with adjustment

Jan Pelikán (2011)

Kybernetika

Similarity:

The subject of this paper is a flow-shop based on a case study aimed at the optimisation of ordering production jobs in mechanical engineering, in order to minimize the overall processing time, the makespan. The production jobs are processed by machines, and each job is assigned to a certain machine for technological reasons. Before processing a job, the machine has to be adjusted; there is only one adjuster who adjusts all of the machines. This problem is treated as a hybrid two-stage...

Scheduling multiprocessor tasks on two parallel processors

Jacek Błażewicz, Paolo Dell'Olmo, Maciej Drozdowski (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Multiprocessor tasks can be executed by more than one processor at the same moment of time. We analyze scheduling unit execution time and preemptable tasks to minimize schedule length and maximum lateness. Cases with ready times, due-dates and precedence constraints are discussed.

An introduction to multiprocessor scheduling.

J.K. Lenstra, A.H.G. Rinnooy (1981)

Qüestiió

Similarity:

This is a tutorial survey of recent results in the area of multiprocessor scheduling. Computational complexity theory provides the framework in which these results are presented. They involve on one hand the development of new polynomial optimization algorithms, and on the other hand the application of the concept of NP-hardness as well as the analysis of approximation algorithms.