Minimizing total weighted completion time on single machine with past-sequence-dependent setup times and exponential time-dependent and position-dependent learning effects
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.
- Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times
- Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects
- Single machine scheduling with a general exponential learning effect
- Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times
- Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects
- A note on scheduling problems with learning effect and deteriorating jobs
- A state-of-the-art review on scheduling with learning effects
- A survey of scheduling problems with setup times or costs
- Complexity results for single-machine scheduling with positional learning effects
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Minimizing total tardiness in a scheduling problem with a learning effect
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with a learning effect
- Scheduling jobs with position-dependent processing times
- Scheduling problems with a learning effect
- Scheduling with general job-dependent learning curves.
- Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times
- Single machine scheduling with learning effect considerations
- Single machine scheduling with past-sequence-dependent setup times and learning effects
- Single-machine and two-machine flowshop scheduling with general learning functions
- Single-machine group scheduling with a time-dependent learning effect
- Single-machine scheduling against due dates with past-sequence-dependent setup times
- Single-machine scheduling problems with a learning effect
- Single-machine scheduling problems with past-sequence-dependent setup times
- Single-machine scheduling problems with the time-dependent learning effect
- Single-machine scheduling with an actual time-dependent learning effect
- Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
- Single-machine scheduling with learning considerations
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
This page was built for publication: Minimizing total weighted completion time on single machine with past-sequence-dependent setup times and exponential time-dependent and position-dependent learning effects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040180)