Due-date assignment and maintenance activity scheduling problem

Authors:
Gur Mosheiov;Daniel Oron
Affiliations:
School of Business Administration and Department of Statistics, The Hebrew University, Jerusalem 91905, Israel;Econometrics and Business Statistics, The University of Sydney, Australia
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2006

Citing 1
Cited 10

Earliness-tardiness scheduling problems: I. Weighted derivation of completion times about a common due date

Operations Research

A note: Common due date assignment for a single machine scheduling with the rate-modifying activity

Computers and Operations Research
Scheduling a maintenance activity and due-window assignment on a single machine

Computers and Operations Research
Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance

Computers and Operations Research
Single machine common flow allowance scheduling with a rate-modifying activity

Computers and Industrial Engineering
Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time

Information Sciences: an International Journal
A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity

Computers and Operations Research
Heuristics for scheduling problems with an unavailability constraint and position-dependent processing times

Computers and Industrial Engineering
Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost

Computers and Industrial Engineering
Scheduling with due date assignment under special conditions on job processing

Journal of Scheduling
Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity

Computers and Industrial Engineering

Quantified Score

Hi-index	0.98

Visualization

Abstract

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.