Job sequencing with exponential functions of processing times
From MaRDI portal
Recommendations
- Single machine scheduling problems with exponentially start time dependent job processing times
- Single machine scheduling with exponential learning functions
- scientific article; zbMATH DE number 1264428
- A Bayesian Sequential Single Machine Scheduling Problem to Minimize the Expected Weighted Sum of Flowtimes of Jobs with Exponential Processing Times
- Scheduling jobs with piecewise linear decreasing processing times
Cited in
(7)- Proportionate flowshops with general position-dependent processing times
- Single-machine scheduling with both deterioration and learning effects
- A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem
- Single machine scheduling problems with exponentially start time dependent job processing times
- A generic approach to proving NP-hardness of partition type problems
- Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration
- A branch and bound algorithm for single machine scheduling with deteriorating values of jobs
This page was built for publication: Job sequencing with exponential functions of processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3417375)
