Pages that link to "Item:Q1337673"

The following pages link to On some geometric methods in scheduling theory: A survey (Q1337673):

Displaying 23 items.

• Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324) (← links)
• A fluid approach to large volume job shop scheduling (Q600845) (← links)
• On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion (Q744655) (← links)
• A linear time approximation algorithm for permutation flow shop scheduling (Q764320) (← links)
• A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines (Q881563) (← links)
• Grouping techniques for scheduling problems: simpler and faster (Q930594) (← links)
• Scheduling of a single crane in batch annealing process (Q1017463) (← links)
• The flow shop problem with no-idle constraints: a review and approximation (Q1027525) (← links)
• Reroute sequence planning in telecommunication networks and compact vector summation. (Q1428596) (← links)
• Concurrent flowshop scheduling to minimize makespan. (Q1429959) (← links)
• Heuristics for the two-stage job shop scheduling problem with a bottleneck machine (Q1569925) (← links)
• A hybrid genetic algorithm for the open shop scheduling problem (Q1576331) (← links)
• Complexity, bounds and dynamic programming algorithms for single track train scheduling (Q1730675) (← links)
• Vector summation within minimal angle (Q1803266) (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
• Rearrangements of series (Q2313724) (← links)
• Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
• Flexible flow shop scheduling with uniform parallel machines (Q2569085) (← links)
• Performance guarantees for flowshop heuristics to minimize makespan (Q2572856) (← links)
• The Open Shop Scheduling Problem (Q3304098) (← links)
• Maximum Inequalities for Rearrangements of Summands and Assignments of Signs (Q3462259) (← links)
• (Q4487091) (← links)
• Scheduling jobshops with some identical or similar jobs (Q5946718) (← links)