Pages that link to "Item:Q3120585"
From MaRDI portal
The following pages link to Review of the ordered and proportionate flow shop scheduling research (Q3120585):
Displaying 26 items.
- The two-machine no-wait general and proportionate open shop makespan problem (Q296784) (← links)
- Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance (Q323343) (← 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)
- Due-window assignment scheduling in the proportionate flow shop setting (Q827100) (← links)
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602) (← links)
- Online scheduling of ordered flow shops (Q1991105) (← links)
- Minmax scheduling and due-window assignment with position-dependent processing times and job rejection (Q2026708) (← links)
- Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights (Q2047217) (← links)
- Improved algorithms for proportionate flow shop scheduling with due-window assignment (Q2069253) (← links)
- Online algorithms to schedule a proportionate flexible flow shop of batching machines (Q2093188) (← links)
- Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection (Q2098030) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
- Flow shops with reentry: reversibility properties and makespan optimal schedules (Q2282537) (← links)
- Approximation algorithms for the three-machine proportionate mixed shop scheduling (Q2283006) (← links)
- Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines (Q2305020) (← links)
- Regular scheduling measures on proportionate flowshop with job rejection (Q2307854) (← 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)
- Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates (Q5216799) (← links)
- Proportionate Flow Shop Scheduling with Rejection (Q5359056) (← links)
- Scheduling a proportionate flow shop of batching machines (Q5919041) (← links)
- A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)
- Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits (Q6547130) (← links)
- Scheduling a two stage proportionate flexible flow shop with dedicated machines and no buffers (Q6606700) (← links)
