Pages that link to "Item:Q2834736"
From MaRDI portal
The following pages link to Optimal two- and three-stage production schedules with set-up time included (Q2834736):
Displaying 50 items.
- Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence (Q490158) (← links)
- Flow shop scheduling on 2-machines with setup time and single transport facility under fuzzy environment (Q505132) (← 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)
- Two-agent single-machine scheduling problems under increasing linear deterioration (Q552491) (← links)
- Elimination conditions and lower bounds for the permutation flow-shop sequencing problem (Q581221) (← links)
- Scheduling algorithms for flexible flowshops: Worst and average case performance (Q583096) (← links)
- Polynomial-time approximation schemes for scheduling problems with time lags (Q600835) (← links)
- An improved algorithm for the two machine flow shop problem with several availability constraints (Q607877) (← links)
- Foreword to the thematical issue devoted to the seventieth anniversary of Academician V. S. Tanaev (Q612200) (← links)
- Two-machine flowshop scheduling with intermediate transportation under job physical space consideration (Q632667) (← links)
- Tight complexity analysis of the relocation problem with arbitrary release dates (Q638514) (← links)
- Inverse scheduling: Two-machine flow-shop problem (Q640308) (← links)
- A unified framework for population-based metaheuristics (Q646652) (← links)
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
- Non-permutation flow shop scheduling with order acceptance and weighted tardiness (Q670790) (← links)
- Batch scheduling in a two-machine flow shop with limited buffer (Q674441) (← links)
- Optimal switching between cash-flow streams (Q684138) (← links)
- New results in the worst-case analysis for flow-shop scheduling (Q689950) (← links)
- On the heuristic solution of the permutation flow shop problem by path algorithms (Q690012) (← links)
- A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints (Q691393) (← links)
- Batching decisions for assembly production systems (Q703918) (← links)
- Makespan minimization in machine dominated flowshop (Q708144) (← links)
- Synchronous flow shop scheduling with pliable jobs (Q723997) (← links)
- Two-machine flow shop and open shop scheduling problems with a single maintenance window (Q724106) (← links)
- A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem (Q730912) (← links)
- A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints (Q732786) (← links)
- Algorithms for a realistic variant of flowshop scheduling (Q732880) (← links)
- Towards a heterogeneous and adaptive parallel branch-and-bound algorithm (Q743112) (← links)
- Isomorphic scheduling problems (Q744639) (← links)
- The connection between the bump number problem and flow-shop scheduling with precedence constraints (Q753673) (← links)
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects (Q763108) (← links)
- A linear time approximation algorithm for permutation flow shop scheduling (Q764320) (← links)
- The Pareto frontier of inefficiency in mechanism design (Q777959) (← links)
- A robust two-machine flow-shop scheduling model with scenario-dependent processing times (Q782088) (← links)
- Research on construction and application for the model of multistage job shop scheduling problem (Q782293) (← links)
- Effective optimization methods for single-machine scheduling (survey) (Q786645) (← links)
- V-shop scheduling (Q795725) (← links)
- Algorithms for two-machine flow-shop sequencing with precedence constraints (Q800822) (← links)
- Flowshop/no-idle scheduling to minimize total elapsed time (Q811886) (← links)
- Filtering policies in loss queueing network location problems (Q816422) (← links)
- Exact method for the two-machine flow-shop problem with time delays (Q829189) (← links)
- The bipartite margin shop and maximum red matchings free of blue-red alternating cycles (Q834189) (← links)
- Makespan distribution of permutation flowshop schedules (Q835630) (← links)
- Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration (Q840154) (← links)
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times (Q850231) (← links)
- Problem \(F2||C_{\max}\) with forbidden jobs in the first or last position is easy (Q856325) (← links)
- Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems (Q856670) (← links)
- An exact parallel method for a bi-objective permutation flowshop problem (Q857297) (← links)
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
