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

Authors:
Suh-Jenq Yang;Dar-Li Yang;T. C. E. Cheng
Affiliations:
Department of Industrial Engineering and Management, Nan Kai University of Technology, Nan-Tou 542, Taiwan;Department of Information Management, National Formosa University, Yun-Lin 632, Taiwan;Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Venue:
Computers and Operations Research
Year:
2010

Citing 6
Cited 10

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Optimal common due-data with limited completion time deviation

Computers and Operations Research
Sequencing with earliness and tardiness penalties: a review

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

Mathematical and Computer Modelling: An International Journal

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

Computers & Mathematics with Applications
Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs

Computers and Industrial Engineering
Single-machine makespan minimization scheduling with nonlinear shortening processing times

Computers and Operations Research
Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities

Computers and Operations Research
Single-machine scheduling problems simultaneously with deterioration and learning effects under deteriorating multi-maintenance activities consideration

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

Journal of Scheduling
Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs

Information Sciences: an International Journal
Makespan minimization flowshop with position dependent job processing times-computational complexity and solution algorithms

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

Computers and Industrial Engineering
Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

Due-window assignment and scheduling are important issues in modern manufacturing management. In this note we consider single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance. The objective is to find jointly the optimal time to perform maintenance, the optimal location and size of the due-window, and the optimal job sequence to minimize the total earliness, tardiness, and due-window related costs. We show that the problem can be optimally solved in O(n^4) time. We also show that a special case of the problem can be optimally solved by a lower order algorithm.