Total weighted completion time scheduling under resource allocation and time-dependent learning effects
From MaRDI portal
Cites work
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- A state-of-the-art review on scheduling with learning effects
- A survey of scheduling with controllable processing times
- A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function
- A unified analysis for single-machine scheduling with resource allocations, learning and deteriorating effects simultaneously
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Controllable processing time scheduling with total weighted completion time objective and deteriorating jobs
- Coordinating scheduling and resource allocation decisions in a proportionate flow-shop scheduling environment
- Earliness-tardiness scheduling with delivery times and deteriorating jobs
- Minmax delivery completion time scheduling with delivery times and deteriorating jobs
- Models and algorithms of time-dependent scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Permutation flow shop scheduling with makespan objective and truncated learning effects
- Proportionate flow shop scheduling with job-dependent due windows and position-dependent weights
- Research on two-machine flow shop scheduling problem with release dates and truncated learning effects
- Scheduling jobs under simple linear deterioration
- Scheduling. Theory, algorithms, and systems.
- Single machine scheduling with learning effect considerations
- Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times
- Single-machine group scheduling with a time-dependent learning effect
- Single-machine group scheduling with general linear deterioration and truncated learning effects
- Single-machine scheduling with learning considerations
- Single-machine time-dependent scheduling with proportional and delivery times
- Solution algorithms for single-machine scheduling with learning effects and exponential past-sequence-dependent delivery times
- Study on single-machine group scheduling with convex resource allocations and different due-date assignments
- Time-dependent scheduling
This page was built for publication: Total weighted completion time scheduling under resource allocation and time-dependent learning effects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7320611)
