Displaying similar documents to “Mathematical Problems on the First and Second Divisions of the Schedule of Subjects”

Scheduling jobs in open shops with limited machine availability

Jacek Błażewicz, Piotr Formanowicz (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this paper, open shop scheduling problems with limited machine availability are studied. Such a limited availability of machines may appear in many real-life situations, e.g. as preventive maintenance activities. Three types of jobs are distinguished: non-preemptable, resumable and preemptable. An operation of a resumable job if not completed before a non-availability period of a machine may be suspended and continued without additional cost when the machine becomes available. In...

Scheduling multiprocessor tasks on two parallel processors

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

RAIRO - Operations Research

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.

Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity

Mohamed Ali Aloulou, Mikhail Y. Kovalyov, Marie-Claude Portmann (2007)

RAIRO - Operations Research

Similarity:

We study a deterministic problem of evaluating the worst case performance of flexible solutions in the single machine scheduling. A flexible solution is a set of schedules following a given structure determined by a partial order of jobs and a type of the schedules. In this paper, the schedules of active and non-delay type are considered. A flexible solution can be used on-line to absorb the impact of data disturbances related to, for example, job arrival, tool availability or machine...

Some scheduling problems with past sequence dependent setup times under the effects of nonlinear deterioration and time-dependent learning

M. Duran Toksarı, Daniel Oron, Ertan Güner (2010)

RAIRO - Operations Research

Similarity:

This paper studies scheduling problems which include a combination of nonlinear job deterioration and a time-dependent learning effect. We use past sequence dependent (p-s-d) setup times, which is first introduced by Koulamas and Kyparisis [ (2008) 1045–1049]. They considered a new form of setup times which depend on all already scheduled jobs from the current batch. Job deterioration and learning co-exist in various real life scheduling settings. By the effects...

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