Pages that link to "Item:Q3750503"
From MaRDI portal
The following pages link to Focused Scheduling in Proportionate Flowshops (Q3750503):
Displayed 38 items.
- Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times (Q337017) (← links)
- Minimizing makespan in an ordered flow shop with machine-dependent processing times (Q411247) (← links)
- Two-machine flow shop scheduling problem with an outsourcing option (Q421578) (← links)
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed (Q852963) (← links)
- Single-machine and two-machine flowshop scheduling with general learning functions (Q859915) (← links)
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics (Q941559) (← links)
- Cooperative metaheuristics for the permutation flowshop scheduling problem (Q958077) (← links)
- Flow shops with machine maintenance: ordered and proportionate cases (Q992582) (← links)
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop (Q1038327) (← links)
- Minimizing total tardiness on a two-machine re-entrant flowshop (Q1042154) (← links)
- A survey of priority rule-based scheduling (Q1111923) (← links)
- Minimizing total tardiness in permutation flowshops (Q1127155) (← links)
- Restricted neighborhood in the tabu search for the flowshop problem (Q1203798) (← links)
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops (Q1260741) (← links)
- An SA/TS mixture algorithm for the scheduling tardiness problem (Q1266621) (← links)
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
- The job shop tardiness problem: A decomposition approach (Q1310711) (← links)
- Flowshop scheduling with dominant machines (Q1342341) (← links)
- The three-machine proportionate flow shop problem with unequal machine speeds (Q1811632) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines (Q1926814) (← links)
- A note on makespan minimization in proportionate flow shops (Q1944041) (← links)
- Proportionate flowshops with general position-dependent processing times (Q1944066) (← links)
- Two-stage proportionate flexible flow shop to minimize the makespan (Q1945694) (← links)
- Proportionate flow shop with controllable processing times (Q1964482) (← links)
- Online scheduling of ordered flow shops (Q1991105) (← links)
- A two-machine no-wait flow shop problem with two competing agents (Q2075466) (← 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)
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness (Q2563893) (← links)
- Scheduling in network flow shops (Q2564878) (← links)
- A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem (Q4398985) (← links)
- An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments (Q4474722) (← links)
- An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments (Q4823493) (← links)
- Polynomial time approximation algorithms for proportionate open‐shop scheduling (Q5246814) (← links)
- Proportionate flow shop: New complexity results and models with due date assignment (Q5249462) (← links)
- Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds (Q5478829) (← links)
- On the complexity of proportionate open shop and job shop problems (Q6181381) (← links)