104 results on '"Rudek, Radosław"'
Search Results
2. Optimizing Maintenance Cost of Uniform Rolling Stock by Scheduling Algorithms
3. A generic optimization framework for scheduling problems under machine deterioration and maintenance activities
4. A fast neighborhood search scheme for identical parallel machine scheduling problems under general learning curves
5. Optimizing Maintenance Cost of Uniform Rolling Stock by Scheduling Algorithms
6. Efficient algorithms for discrete resource allocation problems under degressively proportional constraints
7. Models and algorithms for the preventive maintenance optimization of railway vehicles
8. An Enhancement of Reinforcement Learning by Scheduling with Learning Effects
9. On Ordering a Set of Degressively Proportional Apportionments
10. An approximate/exact objective based search technique for solving general scheduling problems
11. Beyond the Cambridge Compromise algorithm towards degressively proportional allocations
12. The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: Strongly NP-hard
13. Scheduling on parallel processors with varying processing times
14. Computational complexity and solution algorithms for a vector sequencing problem
15. Parallel machine scheduling with general sum of processing time based models
16. Operations research methods in political decisions: a case study on the European Parliament composition
17. Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models
18. On Ordering a Set of Degressively Proportional Apportionments
19. A fast exact algorithm for the allocation of seats for the EU Parliament
20. The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times
21. Makespan minimization flowshop with position dependent job processing times—computational complexity and solution algorithms
22. The solution algorithms for the multiprocessor scheduling with workspan criterion
23. On single processor scheduling problems with learning dependent on the number of processed jobs
24. The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model
25. The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect
26. Complexity Results for Single-Machine Scheduling with Positional Learning Effects
27. A note on the learning effect in multi-agent optimization
28. Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect
29. A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models
30. Solution algorithms for the makespan minimization problem with the general learning model
31. A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times
32. On flowshop scheduling problems with the aging effect and resource allocation
33. Scheduling problems with position dependent job processing times: computational complexity results
34. A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times
35. Some single-machine scheduling problems with the extended sum-of-processing-time-based aging effect
36. CNC Machine Scheduling Problems with the Tool Aging
37. A new approach to the learning effect: Beyond the learning curve restrictions
38. Erratum to: On flowshop scheduling problems with the aging effect and resource allocation
39. Digressive Proportionality in a Cost Sharing of a Common Infrastructure Development
40. Improve railway vehicle availability by scheduling under preventive maintenance policies
41. Beyond the Cambridge Compromise algorithm towards degressively proportional allocations
42. Metaheuristic algorithms for scheduling on parallel machines with variable set-up times
43. A note ‘On a single machine-scheduling problem with separated position and resource effects’
44. Minimising maximum lateness in a single machine scheduling problem with processing time-based aging effects
45. A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times
46. On flowshop scheduling problems with the aging effect and resource allocation
47. Some single-machine scheduling problems with the extended sum-of-processing-time-based aging effect
48. Parallel Computation Approaches to Optimize Learning Systems
49. A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times
50. A note on a makespan minimization problem with a multi-ability learning effect
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.