Pages that link to "Item:Q4111095"
From MaRDI portal
The following pages link to Open Shop Scheduling to Minimize Finish Time (Q4111095):
Displayed 50 items.
- Scheduling ordered open shops (Q580167) (← links)
- An improved approximation algorithm for the partial Latin square extension problem. (Q703265) (← links)
- On the open-shop problem with preemption and minimizing the average completion time (Q703917) (← links)
- Scheduling two-machine no-wait open shops to minimize makespan (Q707009) (← links)
- Scheduling preemptive open shops to minimize total tardiness (Q707141) (← links)
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
- Minimizing the stretch when scheduling flows of divisible requests (Q835622) (← links)
- Almost nonpreemptive schedules (Q922279) (← links)
- On the geometry, preemptions and complexity of multiprocessor and shop scheduling (Q940887) (← links)
- Dense open-shop schedules with release times (Q955015) (← links)
- A genetic algorithm for the proportionate multiprocessor open shop (Q1010271) (← links)
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop (Q1038327) (← links)
- Scheduling incompatible tasks on two machines (Q1042485) (← links)
- On the complexity of preemptive open-shop scheduling problems (Q1058969) (← links)
- A polynomial feasibility test for preemptive periodic scheduling of unrelated processors (Q1067785) (← links)
- The mixed shop scheduling problem (Q1067989) (← links)
- Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival (Q1112720) (← links)
- Cost-minimal preemptive scheduling of independent jobs with release and due dates on open shop under resource constraints (Q1136220) (← links)
- Scheduling periodically occurring tasks on multiple processors (Q1149764) (← links)
- Scheduling open shops with parallel machines (Q1167065) (← links)
- On the complexity of generalized due date scheduling problems (Q1175769) (← links)
- The complexity of shop-scheduling problems with two or three jobs (Q1178530) (← links)
- On the optimality of static policy in stochastic open shop (Q1186946) (← links)
- Two scheduling problems with fuzzy due-dates (Q1198861) (← links)
- Open shop scheduling with machine dependent processing times (Q1201806) (← links)
- The generalized shifting bottleneck procedure (Q1268190) (← links)
- Extensions of coloring models for scheduling purposes (Q1268282) (← links)
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors (Q1278299) (← links)
- Approximability of flow shop scheduling (Q1290640) (← links)
- Makespan minimization in open shops: A polynomial time approximation scheme (Q1290641) (← links)
- Minimizing average completion time in the presence of release dates (Q1290642) (← links)
- Approximation algorithms for two-machine flow shop scheduling with batch setup times (Q1290646) (← links)
- Classical and new heuristics for the open-shop problem: A computational evaluation (Q1296088) (← links)
- A heuristic for the two-machine open-shop scheduling problem with transportation times (Q1296581) (← links)
- Approximation algorithms for the multiprocessor open shop scheduling problem (Q1306353) (← links)
- Lot streaming in open shops (Q1306390) (← links)
- Worst-case analysis of heuristics for open shops with parallel machines (Q1310023) (← links)
- Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function (Q1310024) (← links)
- Constructive heuristic algorithms for the open shop problem (Q1310611) (← links)
- Scheduling two jobs with fixed and nonfixed routes (Q1316587) (← links)
- Scheduling unit time open shops to minimize the weighted number of late jobs (Q1318657) (← links)
- A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem (Q1319570) (← links)
- Lot streaming in three-stage production processes (Q1331614) (← links)
- Two machine open shop scheduling problems with bi-criteria (Q1331894) (← links)
- On the complexity of preemptive openshop scheduling problems (Q1333531) (← links)
- On some geometric methods in scheduling theory: A survey (Q1337673) (← links)
- Complexity analysis of job-shop scheduling with deteriorating jobs (Q1348391) (← links)
- A branch \(\&\) bound algorithm for the open-shop problem (Q1363739) (← links)
- Open shop problem with zero-one time operations and integer release date/deadline intervals (Q1363753) (← links)
- An open shop scheduling problem with a non-bottleneck machine (Q1371949) (← links)