Pages that link to "Item:Q1319564"
From MaRDI portal
The following pages link to Study of a NP-hard cyclic scheduling problem: The recurrent job-shop (Q1319564):
Displayed 15 items.
- A mixed integer programming model for the cyclic job-shop problem with transportation (Q442206) (← links)
- A fluid approach to large volume job shop scheduling (Q600845) (← links)
- A cyclic scheduling problem with an undetermined number of parallel identical processors (Q626651) (← links)
- Tabu search algorithms for cyclic machine scheduling problems (Q880506) (← links)
- Cyclic job shop scheduling problems with blocking (Q940885) (← links)
- A general model for cyclic machine scheduling problems (Q955322) (← links)
- An algorithm for the maximum revenue jobshop problem (Q958087) (← links)
- A sufficient condition for the liveness of weighted event graphs (Q1014950) (← links)
- The complexity of a cyclic scheduling problem with identical machines and precedence constraints (Q1278237) (← links)
- Using timed Petri net to model instruction-level loop scheduling with resource constraints (Q1331226) (← links)
- A study of the cyclic scheduling problem on parallel processors (Q1346694) (← links)
- On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
- The complexity of cyclic shop scheduling problems (Q1607980) (← links)
- Efficient scheduling of periodic information monitoring requests (Q2496080) (← links)
- Scheduling jobshops with some identical or similar jobs (Q5946718) (← links)