scientific article; zbMATH DE number 3889254
analysisannotated bibliographycombinatorial algorithmcomputational complexityprobabilisticschedulingsequencingworst case analysis
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic scheduling theory in operations research (90B35)
[For the entire collection see Zbl 0547.00052.] This is an annotated bibliography of the literature on sequencing and scheduling problems that was published in 1981 or later; the literature prior to 1981 is represented by some books and survey papers. It belongs to a collection of twelve annotated bibliographies on topics within the field of combinatorial optimization.
- Scheduling tasks on two processors with deadlines and additional resources
- Performance of scheduling algorithms for no-wait flowshops with parallel machines
- Open shops with jobs overlap
- A decomposition approach for a resource constrained scheduling problem
- A decomposition approach in a DSS for a resource constrained scheduling problem
- Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
- A review of TSP based approaches for flowshop scheduling
- Complex Scheduling
- scientific article; zbMATH DE number 4076943 (Why is no real title available?)
- CHAIN STRUCTURES IN SCHEDULES TASKS
- A review of the static, stochastic job sequencing literature
- Pre-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 Q3221735)