2,098 research outputs found
Due-date assignment and parallel-machine scheduling with deteriorating jobs
Author name used in this publication: T. C. E. ChengAuthor name used in this publication: L. Y. KangAuthor name used in this publication: C. T. Ng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
Scheduling Jobs and a Variable Maintenance on a Single Machine with Common Due-Date Assignment
We investigate a common due-date assignment scheduling
problem with a variable maintenance on a single machine. The goal is
to minimize the total earliness, tardiness, and due-date cost. We
derive some properties on an optimal solution for our problem. For a
special case with identical jobs we propose an optimal polynomial
time algorithm followed by a numerical example
Parallel-Machine Scheduling Problems with Past-Sequence-Dependent Delivery Times and Aging Maintenance
We consider parallel-machine scheduling problems with past-sequence-dependent (psd) delivery times and aging maintenance. The delivery time is proportional to the waiting time in the system. Each machine has an aging maintenance activity. We develop polynomial algorithms to three versions of the problem to minimize the total absolute deviation of job completion times, the total load, and the total completion time
Due-date assignment and single machine scheduling with deteriorating jobs
Author name used in this publication: T. C. E. ChengAuthor name used in this publication: L. KangAuthor name used in this publication: C. T. Ng2003-2004 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
The matching relaxation for a class of generalized set partitioning problems
This paper introduces a discrete relaxation for the class of combinatorial
optimization problems which can be described by a set partitioning formulation
under packing constraints. We present two combinatorial relaxations based on
computing maximum weighted matchings in suitable graphs. Besides providing dual
bounds, the relaxations are also used on a variable reduction technique and a
matheuristic. We show how that general method can be tailored to sample
applications, and also perform a successful computational evaluation with
benchmark instances of a problem in maritime logistics.Comment: 33 pages. A preliminary (4-page) version of this paper was presented
at CTW 2016 (Cologne-Twente Workshop on Graphs and Combinatorial
Optimization), with proceedings on Electronic Notes in Discrete Mathematic
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
- …