Scheduling with target start times
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1031383
- Scheduling jobs with fixed start and end times
- Time-dependent scheduling
- Scheduling with time-dependent execution times
- Introduction to Scheduling
- scientific article; zbMATH DE number 1070511
- scientific article; zbMATH DE number 721865
- Les problèmes d'ordonnancement
- Scheduling problems
Cites work
- A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
- scientific article; zbMATH DE number 4191384 (Why is no real title available?)
- scientific article; zbMATH DE number 52239 (Why is no real title available?)
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- Minimizing Maximum Promptness and Maximum Lateness on a Single Machine
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
- Solving a bicriterion scheduling problem
Cited in
(6)- The one-machine just-in-time scheduling problem with preemption
- A new model for the preemptive earliness-tardiness scheduling problem
- A multi-objective optimization for preemptive identical parallel machines scheduling problem
- Multicriteria scheduling
- scientific article; zbMATH DE number 1031383 (Why is no real title available?)
- Minimizing Maximum Promptness and Maximum Lateness on a Single Machine
This page was built for publication: Scheduling with target start times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925938)
