The following pages link to (Q3339651):
Displaying 40 items.
- Preemptive scheduling of two uniform parallel machines to minimize total tardiness (Q439607) (← links)
- Scheduling independent two processor tasks on a uniform duo-processor system (Q751995) (← links)
- New directions in scheduling theory (Q786649) (← links)
- Linear programming models for load balancing (Q810365) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- Minimizing the number of late jobs on unrelated machines (Q811339) (← links)
- Necessary and sufficient conditions of optimality for some classical scheduling problems (Q852941) (← links)
- The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
- Minimizing mean flow time with release time constraint (Q914352) (← links)
- Almost nonpreemptive schedules (Q922279) (← links)
- Preemptive scheduling on uniform machines to minimize mean flow time (Q1017456) (← links)
- Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines (Q1040089) (← links)
- New trends in machine scheduling (Q1107428) (← links)
- On the complexity of generalized due date scheduling problems (Q1175769) (← links)
- Production scheduling problems in a textile industry (Q1194728) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- The complexity of scheduling jobs in repetitive manufacturing systems (Q1310021) (← links)
- Open shops with jobs overlap (Q1319530) (← links)
- A better lower bound for on-line scheduling (Q1327292) (← links)
- An ordered independence system and its applications to scheduling problems (Q1330565) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- Parallel machine scheduling with splitting jobs (Q1570839) (← links)
- Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors (Q1698778) (← links)
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem (Q1771351) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- On a scheduling problem in a robotized analytical system (Q1917278) (← links)
- Augmentations of consistent partial orders for the one-machine total tardiness problem (Q1917355) (← links)
- Processor bounding for an efficient non-preemptive task scheduling algorithm (Q2009223) (← links)
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work (Q2025084) (← links)
- Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines (Q2231743) (← links)
- A unified view of parallel machine scheduling with interdependent processing rates (Q2286430) (← links)
- Shop scheduling problems with pliable jobs (Q2294890) (← links)
- Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs (Q2304114) (← links)
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria (Q2356094) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- An examination of job interchange relationships and induction-based proofs in single machine scheduling (Q2399322) (← links)
- Minimizing total tardiness on parallel machines with preemptions (Q2434279) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- On single machine scheduling with resource constraint (Q5963634) (← links)
