Minimizing total weighted completion time on single machine with past-sequence-dependent setup times and exponential time-dependent and position-dependent learning effects
type: Item
instance of: scholarly article
title: Minimizing total weighted completion time on single machine with past-sequence-dependent setup times and exponential time-dependent and position-dependent learning effects
zbMATH Open document ID: 1175.90193
DOI: 10.1155/2009/970510
published in: Discrete Dynamics in Nature and Society
publication date: 2009-11-23T00:00:00Z
full work available at URL: https://eudml.org/doc/229158
review text: Summary: This paper addresses a single-machine problem in which the past-sequence-dependent (p-s-d) setup times and exponential time-dependent and position-dependent learning effects are considered. By the exponential time-dependent learning effect, it means that the processing time of a job is defined by an exponent function of the total actual processing time of the already processed jobs. The setup times are proportional to the length of the already processed jobs. The aim is to minimize the total weighted completion time, this is an NP-hard problem. Under certain conditions, it is shown that the classical WSPT rule is optimal for the problem.
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5637402
author: Kaibiao Sun
author: Hongxing Li
MaRDI profile type: Publication
OpenAlex ID: W2158679517
Wikidata QID: Q58647583
cites work: Single-machine scheduling with learning considerations
cites work: Single machine scheduling with learning effect considerations
cites work: Scheduling problems with a learning effect
cites work: Parallel machine scheduling with a learning effect
cites work: Scheduling with general job-dependent learning curves.
cites work: Scheduling jobs with position-dependent processing times
cites work: A note on scheduling problems with learning effect and deteriorating jobs
cites work: Minimizing total tardiness in a scheduling problem with a learning effect
cites work: Complexity results for single-machine scheduling with positional learning effects
cites work: Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
cites work: Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
cites work: Single-machine group scheduling with a time-dependent learning effect
cites work: Single-machine scheduling problems with the time-dependent learning effect
cites work: Single-machine and two-machine flowshop scheduling with general learning functions
cites work: Single-machine scheduling problems with a learning effect
cites work: Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
cites work: A state-of-the-art review on scheduling with learning effects
cites work: A survey of scheduling problems with setup times or costs
cites work: Single-machine scheduling problems with past-sequence-dependent setup times
cites work: Single machine scheduling with past-sequence-dependent setup times and learning effects
cites work: Single-machine scheduling against due dates with past-sequence-dependent setup times
cites work: Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times
cites work: Single-machine scheduling with an actual time-dependent learning effect
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
description: scientific article; zbMATH DE number 5637402