scientific article; zbMATH DE number 3604658
From MaRDI portal
Publication:4170510
Cited in
(9)- Solving the resource constrained deadline scheduling problem via reduction to the network flow problem
- The one-machine sequencing problem
- The job shop scheduling problem: Conventional and new solution techniques
- Deliberation scheduling for problem solving in time-constrained environments
- A decomposition theory based on a dominance relation and composite jobs
- A linear time algorithm for restricted bin packing and scheduling problems
- Worst case analysis of two heuristics for the set partitioning problem
- Single-machine scheduling with step-deteriorating jobs and rejection
- Preemptive scheduling to minimize mean weighted flow time
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4170510)