Conjugate problems in time-dependent scheduling
From MaRDI portal
Recommendations
Cites work
- A concise survey of scheduling with time-dependent processing times
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- A state-of-the-art review on scheduling with learning effects
- Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
- Complexity of scheduling tasks with time-dependent execution times
- Equivalent time-dependent scheduling problems
- General flow-shop scheduling with resource constraints
- scientific article; zbMATH DE number 5842424 (Why is no real title available?)
- scientific article; zbMATH DE number 955199 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- scientific article; zbMATH DE number 2086777 (Why is no real title available?)
- Minimizing the total weighted completion time of deteriorating jobs
- Scheduling algorithms
- Scheduling jobs with position-dependent processing times
- Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time
- Scheduling start time dependent jobs to minimize the total weighted completion time
- Scheduling with time dependent processing times: Review and extensions
- The complexity of scheduling starting time dependent tasks with release times
Cited in
(10)- Equivalent time-dependent scheduling problems
- Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs
- The Fixed Job Schedule Problem with Working-Time Constraints
- A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration
- Theory and methodology of time-dependent scheduling: past, present and future
- Composition orderings for linear functions and matrix multiplication orderings
- Isomorphic scheduling problems
- Scheduling time-dependent jobs under mixed deterioration
This page was built for publication: Conjugate problems in time-dependent scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1041348)