Pages that link to "Item:Q1290640"

The following pages link to Approximability of flow shop scheduling (Q1290640):

Displaying 50 items.

• A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan (Q337146) (← links)
• Optimal results and numerical simulations for flow shop scheduling problems (Q410955) (← links)
• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
• An FPTAS for the parallel two-stage flowshop problem (Q507441) (← links)
• Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited (Q515553) (← links)
• Inapproximability results for no-wait job shop scheduling. (Q703234) (← links)
• A linear time approximation algorithm for permutation flow shop scheduling (Q764320) (← links)
• Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints (Q814116) (← links)
• Complexity of problem \(TF2|v=1,c=2|C_{\max}\) (Q888964) (← links)
• Optimal control of a two-server flow-shop network (Q892910) (← links)
• Grouping techniques for scheduling problems: simpler and faster (Q930594) (← links)
• Heuristic factory planning algorithm for advanced planning and scheduling (Q1010253) (← links)
• An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
• No-wait shop scheduling: Computational complexity and approximate algorithms (Q1113793) (← links)
• Sevast'yanov's algorithm for the flow-shop scheduling problem (Q1278200) (← links)
• Some results of the worst-case analysis for flow shop scheduling (Q1296692) (← links)
• Heuristics for the two-stage job shop scheduling problem with a bottleneck machine (Q1569925) (← links)
• Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
• A linear time approximation scheme for makespan minimization in an open shop with release dates (Q1866011) (← links)
• A linear time approximation algorithm for movement minimization in conveyor flow shop processing (Q1887913) (← links)
• Preemptive scheduling on two identical parallel machines with a single transporter (Q1944394) (← links)
• Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
• Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
• Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms (Q2242051) (← links)
• The evolution of schematic representations of flow shop scheduling problems (Q2304109) (← links)
• A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops (Q2329473) (← links)
• A combination of flow shop scheduling and the shortest path problem (Q2354293) (← links)
• A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659) (← links)
• A heuristic algorithm for the hospital health examination scheduling problem (Q2426541) (← links)
• Performance guarantees for flowshop heuristics to minimize makespan (Q2572856) (← links)
• An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops (Q2636494) (← links)
• Review of the ordered and proportionate flow shop scheduling research (Q3120585) (← links)
• Transporting jobs through a two‐machine open shop (Q3621908) (← links)
• A model to approximate transient performance of the flowshop (Q3705208) (← links)
• (Q3820362) (← links)
• (Q4352233) (← links)
• (Q4508364) (← links)
• A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan (Q4632189) (← links)
• (Q4806702) (← links)
• Algorithms for Flows over Time with Scheduling Costs (Q5041740) (← links)
• APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS (Q5315931) (← links)
• Approximation Algorithms for Generalized Path Scheduling (Q6065400) (← links)
• Maximizing Throughput in Flow Shop Real-Time Scheduling (Q6084409) (← links)
• Time-flexible min completion time variance in a single machine by quadratic programming (Q6090146) (← links)
• Flow shop scheduling problems with transportation constraints revisited (Q6185848) (← links)
• A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints (Q6204660) (← links)
• Computational complexity and algorithms for two scheduling problems under linear constraints (Q6495885) (← links)
• On the NP-hardness of two scheduling problems under linear constraints (Q6535800) (← links)
• A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops (Q6546990) (← links)