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

Authors:
Min Ji;Jiaojiao Ge;Ke Chen;T. C. E. Cheng
Affiliations:
-;-;-;-
Venue:
Computers and Industrial Engineering
Year:
2013

Citing 16
Cited 0

Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases, and extensions

Mathematics of Operations Research
Single-machine scheduling with a common due window

Computers and Operations Research
A common due-date assignment problem on parallel identical machines

Computers and Operations Research
A note on a due-date assignment on a two-machine flow-shop

Computers and Operations Research
Convex resource allocation for minimizing the makespan in a single machine with job release dates

Computers and Operations Research
Minimizing Completion Time Variance with Compressible Processing Times

Journal of Global Optimization
A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates

Computers and Operations Research
Single machine scheduling with controllable release and processing parameters

Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
A survey of scheduling with controllable processing times

Discrete Applied Mathematics
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
Scheduling with job-dependent learning effects and multiple rate-modifying activities

Information Processing Letters
Single-machine scheduling with learning effect and resource-dependent processing times

Computers and Industrial Engineering
Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities

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

Computers and Operations Research
Due-date assignment and maintenance activity scheduling problem

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider single-machine scheduling with a common due-window and a deteriorating rate-modifying activity. We assume that the processing time of a job is a function of the amount of a resource allocated to it, its position in the processing sequence, and its aging effect. The objective is to minimize the total cost, which is a function of earliness, tardiness, due-window starting time, due-window size, and resource consumption. We consider two models of the job processing time function and provide polynomial-time solution algorithms for the corresponding problems. We also give a more efficient solution algorithm for a special case of the second problem.