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

Authors:
Valery S. Gordon;Alexander A. Tarasevich
Affiliations:
National Academy of Sciences of Belarus, United Institute of Informatics Problems, Minsk, Belarus;National Academy of Sciences of Belarus, United Institute of Informatics Problems, Minsk, Belarus
Venue:
Computers and Operations Research
Year:
2009

Citing 1
Cited 7

Due-date assignment and maintenance activity scheduling problem

Mathematical and Computer Modelling: An International Journal

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
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
Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we study the single machine common due date assignment and scheduling problem with the possibility to perform a rate-modifying activity (RMA) for changing the processing times of the jobs following this activity. The objective is to minimize the total weighted sum of earliness, tardiness and due date costs. Placing the RMA to some position in the schedule can decrease the objective function value. Several properties of the problem are considered which in some cases can reduce the complexity of the solution algorithm.