Entity usage

Showing below up to 50 results in range #1 to #50.

1. Scheduling on a graph with release times: Label: en
2. An improved approximation algorithm for a scheduling problem with transporter coordination: Label: en
3. A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints: Label: en
4. On the complexity of open shop scheduling with time lags: Label: en
5. A note on a single-shift days-off scheduling problem with sequence-dependent labor costs: Label: en
6. Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling: Label: en
7. A note: maximizing the weighted number of just-in-time jobs for a given job sequence: Label: en
8. A note on the shifting bottleneck procedure for job shop scheduling: Label: en
9. Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms: Label: en
10. A multivariate complexity analysis of the material consumption scheduling problem: Label: en
11. Exact and metaheuristic methods for a real-world examination timetabling problem: Label: en
12. Lot streaming for a two-stage assembly system in the presence of handling costs: Label: en
13. Competitive algorithms for demand response management in a smart grid: Label: en
14. Approximation algorithms for batch scheduling with processing set restrictions: Label: en
15. Mathematical challenges in scheduling theory: Label: en
16. Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs: Label: en
17. Optimization of scheduling problems with deterioration effects and an optional maintenance activity: Label: en
18. Competitive two-agent scheduling with release dates and preemption on a single machine: Label: en
19. A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints: Label: en
20. Joint replenishment meets scheduling: Label: en
21. Parallel solutions for preemptive makespan scheduling on two identical machines: Label: en
22. Collaborative optimization of workshop layout and scheduling: Label: en
23. How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring: Label: en
24. A quest for a fair schedule: the international Young Physicists' Tournament: Label: en
25. Editorial: journal of scheduling (2023): Label: en
26. Equitable scheduling on a single machine: Label: en
27. Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection: Label: en
28. A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty: Label: en
29. Minimizing the expected waiting time of emergency jobs: Label: en
30. Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion: Label: en
31. Scheduling a pick and place packaging line: Label: en
32. Simulated annealing with penalization for university course timetabling: Label: en
33. Graph representation of the fixed route dial-a-ride problem: Label: en
34. Local search approaches for the test laboratory scheduling problem with variable task grouping: Label: en
35. Well-behaved online load balancing against strategic jobs: Label: en
36. Malleable scheduling beyond identical machines: Label: en
37. The flexibility of home away pattern sets: Label: en
38. Special issue on papers from the 2019 workshop on models and algorithms for planning and scheduling problems: Label: en
39. Approximation algorithms for the joint replenishment problem with deadlines: Label: en
40. Interval scheduling and colorful independent sets: Label: en
41. Measuring the impact of adversarial errors on packet scheduling strategies: Label: en
42. Scheduling trees with large communication delays on two identical processors: Label: en
43. Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs: Label: en
44. An advanced tabu search algorithm for the job shop problem: Label: en
45. The \(k\)-Track assignment problem on partial orders: Label: en
46. An analysis of totally clairvoyant scheduling: Label: en
47. The state of the art of nurse rostering: Label: en
48. Revisiting branch and bound search strategies for machine scheduling problems: Label: en
49. The on-line multiprocessor scheduling problem with known sum of the tasks: Label: en
50. An exact method to minimize the number of tardy jobs in single machine scheduling: Label: en