Pages that link to "Item:Q1357789"
From MaRDI portal
The following pages link to Shop scheduling problems under precedence constraints (Q1357789):
Displaying 18 items.
- A practical use of Jackson's preemptive schedule for solving the job shop problem (Q922282) (← links)
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations (Q958450) (← links)
- Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695) (← links)
- The total completion time open shop scheduling problem with a given sequence of jobs on one machine (Q1603323) (← links)
- An effective heuristic algorithm for the partial shop scheduling problem (Q1652579) (← links)
- Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage (Q1762032) (← links)
- Open shop scheduling with some additional constraints (Q1911243) (← links)
- Restrictions and preassignments in preemptive open shop scheduling (Q1917354) (← links)
- Shop-scheduling problems with fixed and non-fixed machine orders of the jobs (Q1960324) (← links)
- Complexity of mixed shop scheduling problems: A survey (Q1969835) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Two machine open shop scheduling problem with setup, processing and removal times separated (Q2367419) (← links)
- Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
- Two-Machine Super-Shop Scheduling Problem (Q3978740) (← links)
- (Q4352233) (← links)
- Alternative graph formulation for solving complex factory-scheduling problems (Q4415989) (← links)
- (Q5206679) (← links)
- A Precedence Graph Algorithm for the Shop Scheduling Problem (Q5618270) (← links)
