scientific article; zbMATH DE number 3989090
From MaRDI portal
Publication:3751359
[For the entire collection see Zbl 0599.00013.] A survey of recent results in scheduling theory, is presented. Complexity results and approximation algorithms with their worst case behaviors, are described. The choice of the results presented has been motivated by the importance of a particular result and by its relevance to a computer scheduling problem. Special attention is paid to scheduling under resource constrains and scheduling in microprocessor systems. An extensive bibliography completes the survey.
Recommendations
Cited in
(23)- Preemptive scheduling in the presence of transportation times
- New trends in machine scheduling
- The job shop scheduling problem: Conventional and new solution techniques
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- Scheduling jobs to minimize total cost
- On some geometric methods in scheduling theory: A survey
- One machine scheduling problem with fuzzy duedates
- Evolution based learning in a job shop scheduling environment
- Current trends in deterministic scheduling
- Scheduling in the situation calculus: A case study
- Single machine, scheduling problem with fuzzy precedence relation
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.
- On a scheduling problem in a robotized analytical system
- Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time
- Heuristic for a new multiobjective scheduling problem
- scientific article; zbMATH DE number 3873052 (Why is no real title available?)
- Approximation scheduling algorithms: a survey
- Recent developments in scheduling
- scientific article; zbMATH DE number 5209067 (Why is no real title available?)
- Scheduling
- Mathematical programming formulations for machine scheduling: A survey
- Scientific school of Academician V. S. Tanaev: results on the scheduling theory
- Partial solutions and multifit algorithm for multiprocessor scheduling
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 Q3751359)