The following pages link to (Q3425131):
Displaying 50 items.
- Single machine scheduling problems with uncertain parameters and the OWA criterion (Q282249) (← links)
- Biogeography-based optimization for optimal job scheduling in cloud computing (Q297722) (← links)
- Scheduling with few changes (Q299829) (← links)
- A single machine scheduling problem with two-dimensional vector packing constraints (Q319018) (← links)
- Network construction problems with due dates (Q319443) (← links)
- Book review of: A. Agnetis et al., Multiagent scheduling. Models and algorithms (Q319704) (← links)
- A survey on single crane scheduling in automated storage/retrieval systems (Q323403) (← links)
- Variability of completion time differences in permutation flow shop scheduling (Q337356) (← links)
- Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies (Q342075) (← links)
- Adaptive online scheduling of tasks with anytime property on heterogeneous resources (Q342556) (← links)
- Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines (Q391787) (← links)
- On an extension of the Sort \& Search method with application to scheduling theory (Q392015) (← links)
- On bilevel machine scheduling problems (Q421065) (← links)
- Berth allocation with time-dependent physical limitations on vessels (Q421704) (← links)
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486) (← links)
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
- Production scheduling with alternative process plans (Q439374) (← links)
- Network flow models for intraday personnel scheduling problems (Q475176) (← links)
- Optimizing busy time on parallel machines (Q476900) (← links)
- Online optimization of busy time on parallel machines (Q477193) (← links)
- Scheduling a bounded parallel-batching machine with incompatible job families and rejection (Q489155) (← links)
- Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness (Q499334) (← links)
- Notes on a hierarchical scheduling problem on identical machines (Q506158) (← links)
- On one approach to constructing timetables of freight trains in a railroad network (Q510295) (← links)
- Personnel scheduling: models and complexity (Q541689) (← links)
- Parallel batch scheduling of equal-length jobs with release and due dates (Q600846) (← links)
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective (Q614062) (← links)
- Single-machine batch scheduling minimizing weighted flow times and delivery costs (Q614457) (← links)
- Preemptive scheduling of equal-length jobs in polynomial time (Q626963) (← links)
- An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed (Q632673) (← links)
- A time-indexed LP-based approach for min-sum job-shop problems (Q646647) (← links)
- Minimizing total busy time in parallel scheduling with application to optical networks (Q708204) (← links)
- Scheduling coupled-operation jobs with exact time-lags (Q714025) (← links)
- Scheduling tasks with exponential duration on unrelated parallel machines (Q714038) (← links)
- Connected searching of weighted trees (Q719311) (← links)
- Analysis of the similarities and differences of job-based scheduling problems (Q723975) (← links)
- Solving scheduling and location problems in the plane simultaneously (Q732883) (← links)
- Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) (← links)
- Parametric analysis of the quality of single preemption schedules on three uniform parallel machines (Q829195) (← links)
- Optimally competitive list batching (Q837154) (← links)
- Real-time scheduling to minimize machine busy times (Q906551) (← links)
- An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times (Q968014) (← links)
- Johnson's rule, composite jobs and the relocation problem (Q1011248) (← links)
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298) (← links)
- Conjugate problems in time-dependent scheduling (Q1041348) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization (Q1651513) (← links)
- Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach (Q1652235) (← links)
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty (Q1652531) (← links)
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
