Single-machine scheduling with time window-dependent processing times
From MaRDI portal
Recommendations
- Scheduling with time dependent processing times: Review and extensions
- scientific article; zbMATH DE number 5031195
- Single-machine scheduling problems with start-time dependent processing time
- A concise survey of scheduling with time-dependent processing times
- Scheduling start time dependent jobs to minimize the total weighted completion time
Cited in
(12)- A procedure for the one-machine sequencing problem with dependent jobs
- Maximizing the weighted number of on-time jobs in single machine scheduling with time windows
- A concise survey of scheduling with time-dependent processing times
- Scheduling jobs with a V-shaped time-dependent processing time
- A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times
- Single-machine scheduling problems with start-time dependent processing time
- scientific article; zbMATH DE number 1594558 (Why is no real title available?)
- Scheduling with time dependent processing times: Review and extensions
- scientific article; zbMATH DE number 1859344 (Why is no real title available?)
- Single machine scheduling problems with exponentially start time dependent job processing times
- scientific article; zbMATH DE number 5031195 (Why is no real title available?)
- A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
This page was built for publication: Single-machine scheduling with time window-dependent processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200784)
