Single-machine scheduling with upper bounded maintenance time under the deteriorating effect
type: Item
instance of: scholarly article
title: Single-machine scheduling with upper bounded maintenance time under the deteriorating effect
zbMATH Open document ID: 1264.90096
DOI: 10.1155/2013/756251
author: Pengfei Xue
author: Yulin Zhang
published in: Discrete Dynamics in Nature and Society
publication date: 2013-06-13T00:00:00Z
review text: Summary: We consider a single-machine scheduling problem with upper bounded actual processing time and upper bounded maintenance time under deteriorating effect. The actual processing time of a job is a position-dependent power function. If the actual processing time of a job exceeds the upper bound, tardiness penalty of the job should be paid. And if the maintenance time exceeds the corresponding upper bound, tardiness penalty of the maintenance should also be paid. The maintenance duration studied in the paper is a position-dependent exponential function. The objective is to find jointly the optimal maintenance frequency and the optimal job sequence to minimize the total cost, which is a linear function of the makespan and the total tardiness. We show that the studied scheduling problem can be transformed as a classic assignment problem to solve. There is also shown that a special case of the scheduling problem can be optimally solved by a lower order algorithm.
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6175121
Wikidata QID: Q58921816
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2013/756251
OpenAlex ID: W2147058224
cites work: Scheduling Deteriorating Jobs on a Single Processor
cites work: The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect
cites work: Single machine scheduling with decreasing linear deterioration under precedence constraints
cites work: Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
cites work: Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times
cites work: Single-machine scheduling with a nonlinear deterioration function
cites work: Minimizing total weighted completion time on single machine with past-sequence-dependent setup times and exponential time-dependent and position-dependent learning effects
cites work: A due-date assignment problem with learning effect and deteriorating jobs
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: Survey of scheduling research involving due date determination decisions
cites work: A survey of the state-of-the-art of common due date assignment and scheduling research
cites work: Common due window size and location determination in a single machine scheduling problem
cites work: Scheduling a maintenance activity and due-window assignment on a single machine
cites work: Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect
cites work: Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan
cites work: Scheduling jobs and maintenance activities on parallel machines
cites work: Planning Machine Maintenance in Two-Machine Shop Scheduling
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
description: scientific article; zbMATH DE number 6175121