๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Due-date assignment and maintenance activity scheduling problem

โœ Scribed by Gur Mosheiov; Daniel Oron

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
171 KB
Volume
44
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

โœฆ Synopsis

In the scheduling problem addressed in this note we have to determine: (i) the job sequence, (ii) the (common) due-date, and (iii) the location of a rate modifying (maintenance) activity. Jobs scheduled before (after) the due-date are penalized according to their earliness (tardiness) value. The processing time of a job scheduled after the maintenance activity decreases by a job-dependent factor. The objective is minimum total earliness, tardiness and due-date cost. We introduce a polynomial (O(n 4 )) solution for the problem.

๐Ÿ“œ SIMILAR VOLUMES

Batch scheduling and common due date ass
Batch scheduling and common due date assignment problem: An NP-hard case
โœ Mikhail Y. Kovalyov ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 199 KB

An important special case of the problem studied in arises when there are equal set-up times and equal job processing times. Computational complexity of this case was indicated to be open, however. I prove its NP-hardness.

Two due date assignment problems in sche
Two due date assignment problems in scheduling a single machine
โœ Dvir Shabtay; George Steiner ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 199 KB

We study two single-machine scheduling problems: minimizing the sum of weighted earliness, tardiness and due date assignment penalties and minimizing the weighted number of tardy jobs and due date assignment costs. We prove that both problems are strongly NP-hard and give polynomial solutions for so

Due-date assignment and single machine s
Due-date assignment and single machine scheduling with compressible processing times
โœ T.C.E. Cheng; C. Oวงuz; X.D. Qi ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 588 KB

In this paper we consider a due-date assignment and single machine scheduling problem in which the jobs have compressible processing times. Two models are defined according to the due-date assignment methods used. The first model applies the common (constant) due-date assignment method to assign the