| New strategies for stochastic resource-constrained project scheduling |
9 |
| Approaches to modeling train scheduling problems as job-shop problems with blocking constraints |
8 |
| Scheduling meets n-fold integer programming |
6 |
| Rescheduling due to machine disruption to minimize the total weighted completion time |
6 |
| A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines |
6 |
| The proactive and reactive resource-constrained project scheduling problem |
6 |
| Case mix classification and a benchmark set for surgery scheduling |
6 |
| Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time |
5 |
| A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems |
4 |
| The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs |
4 |
| Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria |
4 |
| Risk-averse single machine scheduling: complexity and approximation |
3 |
| A survey on how the structure of precedence constraints may change the complexity class of scheduling problems |
3 |
| Solving a wind turbine maintenance scheduling problem |
3 |
| A multi-mode resource-constrained project scheduling reformulation for the waterway ship scheduling problem |
3 |
| The impact of overtime as a time-based proactive scheduling and reactive allocation strategy on the robustness of a personnel shift roster |
3 |
| No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths |
3 |
| A new algorithm based on evolutionary computation for hierarchically coupled constraint optimization: methodology and application to assembly job-shop scheduling |
3 |
| A two-stage stochastic program for multi-shift, multi-analyst, workforce optimization with multiple on-call options |
3 |
| An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines |
2 |
| Scheduling and rescheduling elective patients in operating rooms to minimise the percentage of tardy patients |
2 |
| An efficient train scheduling algorithm on a single-track railway system |
2 |
| Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines |
2 |
| Discovering dispatching rules from data using imitation learning: A case study for the job-shop problem |
2 |
| Integrated production and outbound distribution scheduling problems with job release dates and deadlines |
2 |
| The evolution of schematic representations of flow shop scheduling problems |
2 |
| Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs |
2 |
| Multi-stage resource-aware scheduling for data centers with heterogeneous servers |
2 |
| Scheduling recurring radiotherapy appointments in an ion beam facility: Considering optional activities and time window constraints |
2 |
| An implicit model for multi-activity shift scheduling problems |
2 |
| A unified view of parallel machine scheduling with interdependent processing rates |
2 |
| Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines |
2 |
| Single-machine scheduling with job-dependent machine deterioration |
2 |
| Parameterized complexity of a coupled-task scheduling problem |
2 |
| Energy-efficient scheduling and routing via randomized rounding |
2 |
| Scheduling electric vehicles and locating charging stations on a path |
2 |
| The Current state of bounds on benchmark instances of the job-shop scheduling problem |
1 |
| Task assignment with start time-dependent processing times for personnel at check-in counters |
1 |
| Scheduling parallel batching machines in a sequence |
1 |
| Stochastic project management: multiple projects with multi-skilled human resources |
1 |
| An approximation scheme for the bi-scenario sum of completion times trade-off problem |
1 |
| On the parameterized tractability of the just-in-time flow-shop scheduling problem |
1 |
| Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints |
1 |
| Single-machine common due date total earliness/tardiness scheduling with machine unavailability |
1 |
| Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity |
1 |
| Inductive k-independent graphs and c-colorable subgraphs in scheduling: a review |
1 |
| A polynomial-time approximation scheme for the airplane refueling problem |
1 |
| Shared processor scheduling |
1 |
| Combining two-stage stochastic programming and recoverable robustness to minimize the number of late jobs in the case of uncertain processing times |
1 |
| The single-processor scheduling problem with time restrictions: complexity and related problems |
1 |
