The following pages link to (Q4323632):
Displaying 50 items.
- Batch scheduling with deadlines on parallel machines: an NP-hard case (Q287238) (← links)
- Planning computations in a multiprocessor system with unfixed parameters (Q290006) (← links)
- Preemptive scheduling of two uniform parallel machines to minimize total tardiness (Q439607) (← links)
- Optimal correction of execution intervals for multiprocessor scheduling with additional resource (Q499147) (← links)
- Scheduling linearly shortening jobs under precedence constraints (Q552447) (← links)
- Properties of optimal schedules in preemptive shop scheduling (Q628308) (← links)
- Optimal composition ordering problems for piecewise linear functions (Q724224) (← links)
- A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration (Q833646) (← links)
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation (Q835616) (← links)
- Pre-emptive scheduling problems with controllable processing times (Q880501) (← links)
- Scientific school of Academician V. S. Tanaev: results on the scheduling theory (Q893925) (← links)
- Batching and scheduling in a multi-machine flow shop (Q954247) (← links)
- Scheduling time-dependent jobs under mixed deterioration (Q963924) (← links)
- Parallel machine scheduling problems with a single server (Q969356) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Batch scheduling with deadlines on parallel machines (Q1273116) (← links)
- Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method (Q1291768) (← links)
- Two-machine shop scheduling with zero and unit processing times (Q1296097) (← links)
- Resource-constrained project scheduling: A survey of recent developments. (Q1406618) (← links)
- A concise survey of scheduling with time-dependent processing times (Q1410319) (← links)
- Scheduling on uniform parallel machines to minimize maximum lateness (Q1577473) (← links)
- A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
- Single machine scheduling with a generalized job-dependent cumulative effect (Q1702657) (← links)
- Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors (Q1706041) (← links)
- Complexity results for parallel machine problems with a single server (Q1860370) (← links)
- Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine (Q1869884) (← links)
- Makespan minimization on uniform parallel machines with release times (Q1877043) (← links)
- Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs (Q1886856) (← links)
- Integer preemptive scheduling on parallel machines (Q1939681) (← links)
- Minimizing functions of infeasibilities in a two-machine flow shop (Q1969868) (← links)
- Scheduling periodic I/O access with bi-colored chains: models and algorithms (Q2066691) (← links)
- Metric interpolation for the problem of minimizing the maximum lateness for a single machine (Q2069682) (← links)
- An exact algorithm for the preemptive single machine scheduling of equal-length jobs (Q2147002) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Scheduling jobs with a V-shaped time-dependent processing time (Q2215205) (← 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)
- Measures of problem uncertainty for scheduling with interval processing times (Q2393127) (← links)
- Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences (Q2433803) (← links)
- Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
- Routing equal-size messages on a slotted ring (Q2434298) (← links)
- New bounds and algorithms for the transshipment yard scheduling problem (Q2434300) (← links)
- Pareto and scalar bicriterion optimization in scheduling deteriorating jobs (Q2566940) (← links)
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems (Q2668784) (← links)
- Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals (Q2765599) (← links)
- Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan (Q2956870) (← links)
- Integrality Property in Preemptive Parallel Machine Scheduling (Q3392940) (← links)
- A new polynomial algorithm for a parallel identical scheduling problem (Q3517881) (← links)
- (Q4826104) (← links)
- single Machine Preemptive Scheduling With Special Cost Functions<sup>1</sup> (Q4888275) (← links)
