The following pages link to Handbook on Scheduling (Q5754725):
Displaying 50 items.
- Scheduling under a non-reversible energy source: an application of piecewise linear bounding of non-linear demand/cost functions (Q284842) (← links)
- Novel dual discounting functions for the Internet shopping optimization problem: new algorithms (Q310335) (← links)
- Scheduling for data gathering networks with data compression (Q319855) (← links)
- Energy-efficient scheduling in manufacturing companies: a review and research framework (Q320771) (← links)
- A survey on single crane scheduling in automated storage/retrieval systems (Q323403) (← links)
- Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource (Q328919) (← links)
- Energy-oriented scheduling based on evolutionary algorithms (Q337370) (← links)
- Reconstructing binary matrices with timetabling constraints (Q350725) (← links)
- Guest editorial: ``New trends in scheduling'' Centre CNRS ``La Villa Clythia'' Frejus workshop 2010 (Q398851) (← links)
- Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence (Q490158) (← links)
- A study of scheduling problems with preemptions on multi-core computers with GPU accelerators (Q499342) (← links)
- Better permutations for the single-processor scheduling with time restrictions (Q523167) (← links)
- Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
- Modelling and solving grid resource allocation problem with network resources for workflow applications (Q640301) (← links)
- Analysis of the similarities and differences of job-based scheduling problems (Q723975) (← links)
- Communication scheduling in data gathering networks of heterogeneous sensors with data compression: algorithms and empirical experiments (Q724122) (← links)
- Solving scheduling and location problems in the plane simultaneously (Q732883) (← links)
- Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective (Q744648) (← links)
- Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results (Q744660) (← links)
- New perspectives in scheduling theory (Q892831) (← links)
- Approximation algorithms for inventory constrained scheduling on a single machine (Q906561) (← links)
- A survey of variants and extensions of the resource-constrained project scheduling problem (Q992569) (← links)
- Equivalent time-dependent scheduling problems (Q1041934) (← links)
- Scheduling shared continuous resources on many-cores (Q1617293) (← links)
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss (Q1634066) (← links)
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853) (← links)
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion (Q1652026) (← links)
- Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap (Q1652132) (← links)
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work (Q1673940) (← links)
- A generalized classification scheme for crane scheduling with interference (Q1698922) (← links)
- A worker constrained flexible job shop scheduling problem with sequence-dependent setup times (Q1733093) (← links)
- A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion (Q1736840) (← links)
- Sequencing of picking orders in mobile rack warehouses (Q1751810) (← links)
- FPTAS for the two identical parallel machine problem with a single operator under the free changing mode (Q1752167) (← links)
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources (Q1753460) (← links)
- Algorithms for communication scheduling in data gathering network with data compression (Q1755733) (← links)
- Approximability of total weighted completion time with resource consuming jobs (Q1785443) (← links)
- A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations (Q1991311) (← links)
- Computing the execution probability of jobs with replication in mixed-criticality schedules (Q2069250) (← links)
- Metaheuristics for multi-mode capital-constrained project payment scheduling (Q2253378) (← links)
- Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic (Q2255054) (← links)
- Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
- PHEFT: pessimistic image processing workflow scheduling for DSP clusters (Q2283878) (← links)
- Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs (Q2304114) (← links)
- The single-processor scheduling problem with time restrictions: complexity and related problems (Q2304117) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines (Q2317137) (← links)
- Parallel execution of schedules with random dependency graph (Q2317877) (← links)
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods (Q2356015) (← links)
