Scheduling a maintenance activity and due-window assignment on a single machine

Authors:
Gur Mosheiov;Assaf Sarig
Affiliations:
School of Business Administration and Department of Statistics, The Hebrew University, Jerusalem 91905, Israel;School of Business Administration and Department of Statistics, The Hebrew University, Jerusalem 91905, Israel
Venue:
Computers and Operations Research
Year:
2009

Citing 2
Cited 11

A two-machine flowshop scheduling problem with a separated maintenance constraint

Computers and Operations Research
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 scheduling with past-sequence-dependent setup times and deteriorating jobs

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
Heuristics for scheduling problems with an unavailability constraint and position-dependent processing times

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

Journal of Scheduling
Scheduling flexible maintenance activities subject to job-dependent machine deterioration

Journal of Scheduling
Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times

Computers and Operations Research
Exact algorithms for inventory constrained scheduling on a single machine

Journal of Scheduling
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

We study a single machine scheduling and due-window assignment problem. In addition to the traditional decisions regarding sequencing the jobs and scheduling the due-window, we allow an option for performing a maintenance activity. This activity requires a fixed time interval during which the machine is turned off and no production is performed. On the other hand, after the maintenance time, the machine becomes more efficient, as reflected in the new shortened job processing times. The objective is to schedule the jobs, the due-window and the maintenance activity, so as to minimize the total cost consisting of earliness, tardiness, and due-window starting time and size. We introduce an efficient (polynomial time) solution for this problem.