Shop scheduling problems under precedence constraints
From MaRDI portal
Recommendations
Cited in
(21)- Reduction of job-shop problems to flow-shop problems with precedence constraints
- The total completion time open shop scheduling problem with a given sequence of jobs on one machine
- An effective heuristic algorithm for the partial shop scheduling problem
- Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage
- Open shop scheduling with some additional constraints
- Restrictions and preassignments in preemptive open shop scheduling
- Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
- Complexity of mixed shop scheduling problems: A survey
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Two machine open shop scheduling problem with setup, processing and removal times separated
- Vyacheslav Tanaev: contributions to scheduling and related areas
- scientific article; zbMATH DE number 3972609 (Why is no real title available?)
- Two-Machine Super-Shop Scheduling Problem
- scientific article; zbMATH DE number 1008459 (Why is no real title available?)
- scientific article; zbMATH DE number 1054688 (Why is no real title available?)
- Alternative graph formulation for solving complex factory-scheduling problems
- scientific article; zbMATH DE number 7145128 (Why is no real title available?)
- A Precedence Graph Algorithm for the Shop Scheduling Problem
- Open-shop scheduling for unit jobs under precedence constraints
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
This page was built for publication: Shop scheduling problems under precedence constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1357789)
