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.
- Two-machine open-shop scheduling with rejection to minimize the makespan (Q280183) (← links)
- A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job (Q283266) (← links)
- The two-machine no-wait general and proportionate open shop makespan problem (Q296784) (← links)
- Flexible open shop scheduling problem to minimize makespan (Q342284) (← links)
- A study on several combination problems of classic shop scheduling and shortest path (Q344790) (← links)
- A new three-machine shop scheduling: complexity and approximation algorithm (Q386427) (← links)
- Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination (Q387811) (← links)
- A survey on offline scheduling with rejection (Q398830) (← links)
- Routing open shop and flow shop scheduling problems (Q421573) (← links)
- OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises (Q492852) (← links)
- Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
- Scheduling ordered open shops (Q580167) (← links)
- Polynomial-time approximation schemes for scheduling problems with time lags (Q600835) (← links)
- Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication (Q623798) (← links)
- Properties of optimal schedules in preemptive shop scheduling (Q628308) (← 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)
- Two-machine flow shop and open shop scheduling problems with a single maintenance window (Q724106) (← links)
- Isomorphic scheduling problems (Q744639) (← links)
- A note on the proof of the complexity of the little-preemptive open-shop problem (Q763116) (← links)
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
- Minimizing the stretch when scheduling flows of divisible requests (Q835622) (← links)
- On the complexity of constructing multiprocessor little-preemptive schedules (Q902062) (← 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)
- An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times (Q968014) (← links)
- The museum visitor routing problem (Q969135) (← links)
- A projective algorithm for preemptive open shop scheduling with two multiprocessor groups (Q969520) (← 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)