Single-machine makespan minimization scheduling with nonlinear shortening processing times

Authors:
Ming-Zheng Wang;Ji-Bo Wang
Affiliations:
School of Science, Shenyang Aerospace University, Shenyang 110136, China;School of Management Science and Engineering, Dalian University of Technology, Dalian 116024, China
Venue:
Computers and Operations Research
Year:
2012

Citing 9
Cited 0

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times

Computers and Operations Research
Batch scheduling of step deteriorating jobs

Journal of Scheduling
Time-Dependent Scheduling

Time-Dependent Scheduling
A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs

Computers and Operations Research
The common due-date early/tardy scheduling problem on a parallelmachine under the effects of time-dependent learning and linear and nonlinear deterioration

Expert Systems with Applications: An International Journal
Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance

Computers and Operations Research
Scheduling jobs under decreasing linear deterioration

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

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we consider the single-machine makespan minimization scheduling problem with nonlinear shortening processing times. By the nonlinear shortening processing times, we mean that the processing times of jobs are non-increasing nonlinear functions of their starting times. The computational complexity of the general problem remains an open problem, but we show that even with the introduction of nonlinear shortening processing times to job processing times, some special cases remain polynomially solvable. We also show that an optimal schedule of the general makespan minimization problem is V-shaped with respect to job normal processing times. A heuristic algorithm which utilize the V-shaped property is proposed, and computational experiments show that it is effective and efficient in obtaining near-optimal solutions.