Computer-Aided complexity classification of combinational problems
From MaRDI portal
Recommendations
Cited in
(13)- The job shop scheduling problem: Conventional and new solution techniques
- Problems, models and complexity. I: Theory
- Machine scheduling with earliness, tardiness and non-execution penalties
- Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
- Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
- Scheduling identical jobs on uniform parallel machines
- Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints
- Developing feasible and optimal schedules of jobs on one machine
- scientific article; zbMATH DE number 1305102 (Why is no real title available?)
- SCHEDULING INTERVAL ORDERS IN PARALLEL
- Parameterized algorithms and complexity for scheduling with precedence constraints and time windows
- New directions in scheduling theory
- A classification scheme for vehicle routing and scheduling problems
This page was built for publication: Computer-Aided complexity classification of combinational problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3953190)