7 results on '"Rudek, Radosław"'
Search Results
2. A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times
3. Scheduling problems with position dependent job processing times: computational complexity results
4. The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: Strongly NP-hard.
5. On single processor scheduling problems with learning dependent on the number of processed jobs
6. A note on the learning effect in multi-agent optimization
7. A fast neighborhood search scheme for identical parallel machine scheduling problems under general learning curves.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.