Pages that link to "Item:Q1331888"
From MaRDI portal
The following pages link to Analysis of scheduling problems with typed task systems (Q1331888):
Displaying 8 items.
- The counting complexity of a simple scheduling problem (Q1038110) (← links)
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← links)
- Review of properties of different precedence graphs for scheduling problems (Q1847252) (← links)
- Approximations for the two-machine cross-docking flow shop problem (Q2446855) (← links)
- Scheduling unit length jobs with parallel nested machine processing set restrictions (Q2566928) (← links)
- TWO CONP-COMPLETE SCHEDULE ANALYSIS PROBLEMS (Q5249280) (← links)
- Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times (Q5888383) (← links)
- Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines (Q6547133) (← links)