The following pages link to (Q3217922):
Displaying 50 items.
- An effective lower bound on \(L_{\max}\) in a worker-constrained job shop (Q339585) (← links)
- Single machine batch scheduling with release times and delivery costs (Q398839) (← links)
- Preemptive online scheduling with rejection of unit jobs on two uniformly related machines (Q398903) (← links)
- A competitive two-agent scheduling problem on parallel machines with release dates and preemption (Q460140) (← links)
- Preemptive scheduling of equal-length jobs in polynomial time (Q626963) (← links)
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time (Q668523) (← links)
- On-line scheduling to minimize average completion time revisited. (Q703266) (← links)
- Jackson's pseudo-preemptive schedule and cumulative scheduling problems (Q705501) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- Minimizing the stretch when scheduling flows of divisible requests (Q835622) (← links)
- Online weighted flow time and deadline scheduling (Q849627) (← links)
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints (Q868990) (← links)
- An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness (Q880552) (← links)
- Preemptive scheduling to minimize mean weighted flow time (Q910208) (← links)
- Preemptive scheduling on uniform parallel machines with controllable job processing times (Q930610) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- Preemptive scheduling on uniform machines to minimize mean flow time (Q1017456) (← links)
- Scheduling periodically occurring tasks on multiple processors (Q1149764) (← links)
- Scheduling open shops with parallel machines (Q1167065) (← links)
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time (Q1171502) (← links)
- Surrogate duality relaxation for job shop scheduling (Q1171504) (← links)
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness (Q1261479) (← links)
- Minimizing average completion time in the presence of release dates (Q1290642) (← links)
- Scheduling uniform machines on-line requires nondecreasing speed ratios (Q1290644) (← links)
- Nearly on line scheduling of preemptive independent tasks (Q1346697) (← links)
- Is a unit-job shop not easier than identical parallel machines? (Q1392555) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- A 1. 47-approximation for a preemptive single-machine scheduling problem (Q1577468) (← links)
- The flow shop with parallel machines: A tabu search approach (Q1609888) (← links)
- Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates (Q1761994) (← links)
- Optimal parallel machines scheduling with availability constraints (Q1775061) (← links)
- Scheduling a single machine to minimize a regular objective function under setup constraints (Q1779690) (← links)
- An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines (Q1870003) (← links)
- Lower bounds for on-line single-machine scheduling. (Q1874403) (← links)
- Scheduling with limited machine availability (Q1969884) (← links)
- Scheduling multiprocessor tasks for mean flow time criterion (Q1977621) (← links)
- Ideal schedules in parallel machine settings (Q2029359) (← links)
- Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion (Q2030503) (← links)
- An exact algorithm for the preemptive single machine scheduling of equal-length jobs (Q2147002) (← links)
- Modeling single machine preemptive scheduling problems for computational efficiency (Q2288995) (← links)
- Shop scheduling problems with pliable jobs (Q2294890) (← links)
- Malleable scheduling for flows of jobs and applications to MapReduce (Q2304112) (← links)
- Parallel machine scheduling with machine availability and eligibility constraints (Q2384614) (← links)
- Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times (Q2398640) (← links)
- Efficient computation of optimal energy and fractional weighted flow trade-off schedules (Q2408929) (← links)
- Parallel machine problems with equal processing times: a survey (Q2434248) (← links)
- Minimizing total tardiness on parallel machines with preemptions (Q2434279) (← links)
- Single-machine scheduling with no idle time and release dates to~minimize a regular criterion (Q2434281) (← links)
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates (Q2490322) (← links)
- Multi-project scheduling problem under shared multi-skill resource constraints (Q2701180) (← links)
