Scheduling of resource tasks
From MaRDI portal
DOI10.1016/S0377-2217(98)00226-4zbMATH Open0938.90025MaRDI QIDQ1809809FDOQ1809809
Publication date: 25 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
Cites Work
- Optimal scheduling for two-processor systems
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- Title not available (Why is that?)
- Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
- Minimizing setups in ordered sets of fixed width
- Scheduling independent 2-processor tasks to minimize schedule length
- Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length
- Scheduling tree-structured tasks with restricted execution times
- Title not available (Why is that?)
Cited In (14)
- S3 sets. An extension of the Beale-Tomlin special ordered sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Object-oriented interaction in resource constrained scheduling
- Resource constrained chain scheduling of UET jobs on two machines
- Title not available (Why is that?)
- Scheduling tasks on a flexible manufacturing machine to minimize tool change delays
- Title not available (Why is that?)
- Algorithms for dynamic scheduling of unit execution time tasks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Acquisition planning and scheduling of computing resources
- On the stabilization of resource usage for cyclical sequencing problems
This page was built for publication: Scheduling of resource tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1809809)