13 research outputs found
Single machine scheduling with general positional deterioration and rate-modifying maintenance
We present polynomial-time algorithms for single machine problems with generalized positional deterioration effects and machine maintenance. The decisions should be taken regarding possible sequences of jobs and on the number of maintenance activities to be included into a schedule in order to minimize the overall makespan. We deal with general non-decreasing functions to represent deterioration rates of job processing times. Another novel extension of existing models is our assumption that a maintenance activity does not necessarily fully restore the machine to its original perfect state. In the resulting schedules, the jobs are split into groups, a particular group to be sequenced after a particular maintenance period, and the actual processing time of a job is affected by the group that job is placed into and its position within the group
Single machine scheduling with a generalized job-dependent cumulative effect
We consider a single machine scheduling problem with changing processing times. The processing conditions are subject to a general cumulative effect, in which the processing time of a job depends on the sum of certain parameters associated with previously scheduled jobs. In previous papers, these parameters are assumed to be equal to the normal processing times of jobs, which seriously limits the practical application of this model. We further generalize this model by allowing every job to respond differently to these cumulative effects. For the introduced model, we solve the problem of minimizing the makespan, with and without precedence constraints. For the problem without precedence constraints, we also consider a situation in which a maintenance activity is included in the schedule, which can improve the processing conditions of the machine, not necessarily to its original state. The resulting problem is reformulated as a variant of a Boolean programming problem with a quadratic objective, known as a half-product, which allows us to develop a fully polynomial-time approximation scheme with the best possible running time
Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
We consider a scheduling problem on a single machine to minimize the makespan. The processing conditions are subject to cumulative deterioration, but can be restored by a single maintenance. We link the problem to the Subset-sum problem (if the duration of maintenance is constant) and to the Half-Product Problem (if the duration of maintenance depends on its start time). For both versions of the problem, we adapt the existing fully polynomial-time approximation schemes to our problems by handling the additive constants
Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance
We study single machine scheduling problems with linear time-dependent deterioration effects and maintenance activities. Maintenance periods (MPs) are included into the schedule, so that the machine, that gets worse during the processing, can be restored to a better state. We deal with a job-independent version of the deterioration effects, that is, all jobs share a common deterioration rate. However, we introduce a novel extension to such models and allow the deterioration rates to change after every MP. We study several versions of this generalized problem and design a range of polynomial-time solution algorithms that enable the decision-maker to determine possible sequences of jobs and MPs in the schedule, so that the makespan objective can be minimized. We show that all problems reduce to a linear assignment problem with a product matrix and can be solved by methods very similar to those used for solving problems with positional effects
Combining time and position dependent effects on a single machine subject to rate-modifying activities
We introduce a general model for single machine scheduling problems, in which the actual processing times of jobs are subject to a combination of positional and time-dependent effects, that are job-independent but additionally depend on certain activities that modify the processing rate of the machine, such as, maintenance. We focus on minimizing two classical objectives: the makespan and the sum of the completion times. The traditional classification accepted in this area of scheduling is based on the distinction between the learning and deterioration effects on one hand, and between the positional effects and the start-time dependent effects on the other hand. Our results show that in the framework of the introduced model such a classification is not necessary, as long as the effects are job-independent. The model introduced in this paper covers most of the previously known models. The solution algorithms are developed within the same general framework and their running times are no worse than those available earlier for problems with less general effects
A fast FPTAS for single machine scheduling problem of minimizing total weighted earliness and tardiness about a large common due date
We address the single machine scheduling problem to minimize the total weighted earliness and tardiness about a nonrestrictive common due date. This is a basic problem with applications to the just-in-time manufacturing. The problem is linked to a Boolean programming problem with a quadratic objective function, known as the half-product. An approach to developing a fast fully polynomial-time approximation scheme (FPTAS) for the problem is identified and implemented. The running time matches the best known running time for an FPTAS for minimizing a half-product with no additive constan
Recommended from our members
Machine scheduling with changing processing times and rate-modifying activities
In classical scheduling models, it is normally assumed that the processing times of jobs are fixed. However, in the recent years, there has been a growing interest in models with variable processing times. Some of the common rationales provided for considering such models, is as follows: the machine conditions may deteriorate as more jobs are processed, resulting in higher than normal processing times, or conversely, the machine’s operator may gain more experience as more jobs are processed, so he/she can process the jobs faster. Another direction of improving the practical relevance of models is by introducing certain rate-modifying activities, such as maintenance periods, in the schedule.
In this thesis, we mainly focus on the study of integrated models which allow changing processing times and rate-modifying activities. When this project was started, it was felt that there was a major scope of improvement in the area, both in terms of creating more general, practically relevant models and developing faster algorithms that are capable of handling a wide variety of problems. In this thesis, we address both these issues.
We introduce several enhanced, practically relevant models for scheduling problems with changing times that allow various types of rate-modifying activities, various effects or a combination of effects on the processing times. To handle these generalised models, we developed a unified framework of algorithms that use similar general principles, through which, the effects of rate-modifying activities can be systematically studied for many different scenarios
Recommended from our members
Scheduling with Time-Changing Effects and Rate-Modifying Activities
In scheduling theory, the models that have attracted considerable attention during the last two decades allow the processing times to be variable, i.e., to be subjected to various effects that make the actual processing time of a job dependent on its location in a schedule. The impact of these effects includes, but is not limited to, deterioration and learning. Under the first type of effect, the later a job is scheduled, the longer its actual processing time becomes. In the case of learning, delaying a job will result in shorter processing times. Scheduling with Times-Changing Effects and Rate-Modifying Activities covers and advances the state-of-the-art research in this area.
The book focuses on single machine and parallel machine scheduling problems to minimize either the maximum completion time or the sum of completion times of all jobs, provided that the processing times are subject to various effects. Models that describe deterioration and learning effects to be considered include positional, start-time dependent, combined and cumulative, which cover most of the traditionally used models. The authors also consider more enhanced models in which the decision-maker may insert certain Rate-Modifying Activities (RMA) on processing machines, such as for example, maintenance or rest periods. In any case, the processing times of jobs are not only dependent on effects mentioned above but also on the place of a job in a schedule relative to an RMA. For most of the enhanced models described in the book, the polynomial time algorithms presented are based on similar algorithmic ideas such as reduction to linear assignment problems (in a full form or in a reduced form), discrete convexity, and controlled generation of options