Pages that link to "Item:Q1268838"

The following pages link to Minimizing total weighted completion time in a proportionate flow shop (Q1268838):

Displaying 36 items.

• A survey on offline scheduling with rejection (Q398830) (← links)
• Minimizing makespan in an ordered flow shop with machine-dependent processing times (Q411247) (← links)
• The just-in-time scheduling problem in a flow-shop scheduling system (Q421784) (← links)
• A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop (Q477611) (← links)
• A note: minimizing maximum earliness on a proportionate flowshop (Q477650) (← links)
• Proportionate flow shop games (Q835628) (← links)
• Minimizing maximum completion time in a proportionate flow shop with one machine of different speed (Q852963) (← links)
• Minimizing total flow time and total completion time with immediate dispatching (Q878441) (← links)
• Flow shops with machine maintenance: ordered and proportionate cases (Q992582) (← links)
• Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602) (← links)
• The three-machine proportionate flow shop problem with unequal machine speeds (Q1811632) (← links)
• A note on makespan minimization in proportionate flow shops (Q1944041) (← links)
• Two-stage proportionate flexible flow shop to minimize the makespan (Q1945694) (← links)
• Proportionate flow shop with controllable processing times (Q1964482) (← links)
• Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates (Q2066679) (← links)
• A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
• The proportionate flow shop total tardiness problem (Q2178064) (← links)
• Scheduling problems over a network of machines (Q2281619) (← links)
• Flow shops with reentry: reversibility properties and makespan optimal schedules (Q2282537) (← links)
• Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times (Q2290581) (← links)
• Shop scheduling problems with pliable jobs (Q2294890) (← links)
• Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041) (← links)
• Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem (Q2770103) (← links)
• Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem (Q3611971) (← links)
• Minimizing Mean Completion Time for Special Flowshop Problems (Q4341060) (← links)
• (Q4471337) (← links)
• Scheduling Problems over Network of Machines (Q5002605) (← links)
• Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs (Q5012893) (← links)
• Proportionate flowshop scheduling with position-dependent weights (Q5059283) (← links)
• Proportionate flow shop: New complexity results and models with due date assignment (Q5249462) (← links)
• Proportionate Flow Shop Scheduling with Rejection (Q5359056) (← links)
• Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds (Q5478829) (← links)
• Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system (Q6054756) (← links)
• Approximation Algorithms for Generalized Path Scheduling (Q6065400) (← links)
• On the complexity of proportionate open shop and job shop problems (Q6181381) (← links)
• Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times (Q6577340) (← links)