Single-machine group scheduling problems with deterioration to minimize the sum of completion times
type: Item
instance of: scholarly article
title: Single-machine group scheduling problems with deterioration to minimize the sum of completion times
zbMATH Open document ID: 1264.90091
DOI: 10.1155/2012/275239
author: Yong He
author: Li Sun
published in: Mathematical Problems in Engineering
publication date: 2013-06-11T00:00:00Z
review text: Summary: We consider two single-machine group scheduling problems with deteriorating group setup and job processing times. That is, the job processing times and group setup times are linearly increasing (or decreasing) functions of their starting times. Jobs in each group have the same deteriorating rate. The objective of scheduling problems is to minimize the sum of completion times. We show that the sum of completion times minimization problems remains polynomially solvable under the agreeable conditions.
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6173149
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2012/275239
OpenAlex ID: W2111661388
Wikidata QID: Q58911367
cites work: Scheduling Deteriorating Jobs on a Single Processor
cites work: A concise survey of scheduling with time-dependent processing times
cites work: Single machine scheduling with decreasing linear deterioration under precedence constraints
cites work: A branch and bound algorithm for single machine scheduling with deteriorating values of jobs
cites work: Some single-machine and flowshop scheduling problems with a non-linear deterioration function
cites work: Single-machine total completion time scheduling with a time-dependent deterioration
cites work: Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning
cites work: Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times
cites work: Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
cites work: Single-machine scheduling with time-and-resource-dependent processing times
cites work: Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
cites work: Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
cites work: Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine
cites work: Single-machine group scheduling with general deterioration and learning effects
cites work: Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs
Recommended article: Single-machine group scheduling problems with deterioration consideration
Recommended article: Single Machine Group Scheduling Problems with the Effects of Deterioration and Learning
Recommended article: Single machine group scheduling under decreasing linear deterioration
Recommended article: Single-machine group scheduling with deteriorating jobs and allotted resource
Recommended article: Single-machine group scheduling problems with deteriorating and learning effect
Recommended article: Single-machine group scheduling problems with deteriorated and learning effect
Recommended article: Single-machine group scheduling with general deterioration and learning effects
Recommended article: Single-machine scheduling problems with an actual time-dependent deterioration
Recommended article: Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine
description: scientific article; zbMATH DE number 6173149