Pages that link to "Item:Q3657429"
From MaRDI portal
The following pages link to Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines (Q3657429):
Displaying 27 items.
- A model for minimizing active processor time (Q487001) (← links)
- Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem (Q490323) (← links)
- Parallel batch scheduling of equal-length jobs with release and due dates (Q600846) (← links)
- Preemptive scheduling of equal-length jobs in polynomial time (Q626963) (← links)
- Scheduling jobs with equal processing times subject to machine eligibility constraints (Q633548) (← links)
- New directions in scheduling theory (Q786649) (← links)
- Scheduling jobs with equal processing times and time windows on identical parallel machines (Q835604) (← links)
- Arc-B-consistency of the inter-distance constraint (Q879973) (← links)
- Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems (Q935148) (← links)
- On a parallel machine scheduling problem with equal processing times (Q1028485) (← links)
- A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile (Q1121783) (← links)
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem (Q1339135) (← links)
- On minimizing the weighted number of late jobs in unit execution time open-shops. (Q1399578) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- Scheduling equal-length jobs on identical parallel machines (Q1570817) (← links)
- Theoretical expectation versus practical performance of Jackson's heuristic (Q1665791) (← links)
- Lower bounds on precedence-constrained scheduling for parallel processors. (Q1853033) (← links)
- Scheduling multiprocessor tasks for mean flow time criterion (Q1977621) (← links)
- Ideal schedules in parallel machine settings (Q2029359) (← links)
- A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← links)
- Scheduling equal length jobs with eligibility restrictions (Q2288997) (← links)
- Multi-machine scheduling lower bounds using decision diagrams (Q2294251) (← links)
- Parallel machine problems with equal processing times: a survey (Q2434248) (← links)
- Variants of Multi-resource Scheduling Problems with Equal Processing Times (Q3467836) (← links)
- A new polynomial algorithm for a parallel identical scheduling problem (Q3517881) (← links)
- Bicriteria multi-machine scheduling with equal processing times subject to release dates (Q6145328) (← links)
- A scheduling framework for distributed key-value stores and its application to tail latency minimization (Q6547138) (← links)
