A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity

Authors:
Chuanli Zhao;Hengyong Tang
Affiliations:
School of Mathematics and Systems Science, Shenyang Normal University, Shenyang, Liaoning 110034, People's Republic of China;School of Mathematics and Systems Science, Shenyang Normal University, Shenyang, Liaoning 110034, People's Republic of China
Venue:
Computers and Operations Research
Year:
2012

Citing 4
Cited 6

Minimizing the total weighted completion time of deteriorating jobs

Information Processing Letters
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
Due-date assignment and maintenance activity scheduling problem

Mathematical and Computer Modelling: An International Journal

Single-machine makespan minimization scheduling with nonlinear shortening processing times

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

Information Sciences: an International Journal
Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties

Information Sciences: an International Journal
Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times

Computers and Operations Research
Genetic algorithms for single machine scheduling with time-dependent deterioration and rate-modifying activities

Expert Systems with Applications: An International Journal
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.01

Visualization

Abstract

This note considers a single machine scheduling and due-window assignment problem, in which the processing time of a job is a linear function of its starting time and the job-independent deterioration rates are identical for all jobs. We allow an option for performing a rate-modifying activity for changing the normal processing times of the jobs following this activity. The objective is to schedule the jobs, the due-window and the rate-modifying activity so as to minimize the sum of earliness, tardiness and due-window starting time and due-window size costs. We introduce a polynomial solution for the problem.