Scheduling on identical machines with setup time and unknown execution time
From MaRDI portal
Cites work
- A hybrid genetic algorithm for the single machine scheduling problem
- A survey of scheduling problems with setup times or costs
- Bounds for Certain Multiprocessing Anomalies
- Bounds for naive multiple machine scheduling with release times and deadlines
- Competitive analysis of the online dial-a-ride problem
- scientific article; zbMATH DE number 1629830 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- scientific article; zbMATH DE number 7650088 (Why is no real title available?)
- Non-clairvoyant makespan minimization scheduling with predictions
- Non-clairvoyant scheduling to minimize MAX flow time on a machine with setup times
- Nonclairvoyant scheduling
- On-line dial-a-ride problems under a restricted information model
- On-line scheduling with setup costs
- On-line single-server dial-a-ride problems
- Online scheduling on identical machines with a metric state space
- Scheduling
- Scheduling Parallel Machines On-Line
- Scheduling with obligatory tests
- Single-Server, Two-Machine Sequencing with Switching Time
- Submodular Approximation: Sampling-based Algorithms and Lower Bounds
- Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
- Worst-case analysis of a new heuristic for the travelling salesman problem
This page was built for publication: Scheduling on identical machines with setup time and unknown execution time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312593)
